ICAR Research Data Repository for Knowledge Management
Higher weights of Grassmann codes
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
Higher weights of Grassmann codes
|
|
| Creator |
GHORPADE, SR
LACHAUD, G |
|
| Description |
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.
|
|
| Publisher |
SPRINGER-VERLAG BERLIN
|
|
| Date |
2011-10-27T00:55:36Z
2011-12-15T09:12:38Z 2011-10-27T00:55:36Z 2011-12-15T09:12:38Z 2000 |
|
| Type |
Proceedings Paper
|
|
| Identifier |
CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS,122-131
3-540-66248-0 http://dspace.library.iitb.ac.in/xmlui/handle/10054/16187 http://hdl.handle.net/100/2789 |
|
| Source |
International Conference on Coding Theory, Cryptography and Related Areas,GUANAJUATO, MEXICO,APR 20-24, 1998
|
|
| Language |
English
|
|