Back to Search
Start Over
Codes and Anticodes in the Grassman Graph
- Source :
-
Journal of Combinatorial Theory - Series A . Jan2002, Vol. 97 Issue 1, p27. 16p. - Publication Year :
- 2002
-
Abstract
- Perfect codes and optimal anticodes in the Grassman graph Gq(n, k) are examined. It is shown that the vertices of the Grassman graph cannot be partitioned into optimal anticodes, with a possible exception when n=2k. We further examine properties of diameter perfect codes in the graph. These codes are known to be similar to Steiner systems. We discuss the connection between these systems and “real” Steiner systems. [Copyright &y& Elsevier]
- Subjects :
- *GRAPHIC methods
*STEINER systems
Subjects
Details
- Language :
- English
- ISSN :
- 00973165
- Volume :
- 97
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Journal of Combinatorial Theory - Series A
- Publication Type :
- Academic Journal
- Accession number :
- 8501804
- Full Text :
- https://doi.org/10.1006/jcta.2001.3188