Codes and Anticodes in the Grassman Graph
- 1 January 2002
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 97 (1) , 27-42
- https://doi.org/10.1006/jcta.2001.3188
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On Perfect Codes and Related ConceptsDesigns, Codes and Cryptography, 2001
- Perfect byte-correcting codesIEEE Transactions on Information Theory, 1998
- On the Nonexistence of Perfect Codes in the Johnson SchemeSIAM Journal on Discrete Mathematics, 1996
- Anticodes for the Grassman and bilinear forms graphsDesigns, Codes and Cryptography, 1995
- The Erdös-Ko-Rado theorem for vector spacesJournal of Combinatorial Theory, Series A, 1986