Please use this identifier to cite or link to this item:
|Title:||Higher weights of Grassmann codes|
|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.|
|Appears in Collections:||Proceedings papers|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.