DSpace
 

DSpace at IIT Bombay >
IITB Publications >
Proceedings papers >

Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/jspui/handle/100/2789

Title: Higher weights of Grassmann codes
Authors: GHORPADE, SR
LACHAUD, G
Issue Date: 2000
Publisher: SPRINGER-VERLAG BERLIN
Citation: CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS,122-131
Abstract: Using a combinatorial approach to studying the hyperplane sections of Grassmannians, we give two new proofs of a result of Nogin concerning the higher weights of Grassmann codes, As a consequence, we obtain a bound on the number of higher dimensional subcodes of the Grassmann code having the minimum Hamming norm. We also discuss a generalization of Grassmann codes.
URI: http://dspace.library.iitb.ac.in/xmlui/handle/10054/16187
http://hdl.handle.net/100/2789
ISBN: 3-540-66248-0
Appears in Collections:Proceedings papers

Files in This Item:

There are no files associated with this item.

View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback