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.
Original language | English |
---|---|
Pages (from-to) | 27-42 |
Number of pages | 16 |
Journal | Journal of Combinatorial Theory. Series A |
Volume | 97 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2002 |
Externally published | Yes |
Keywords
- Anticodes
- Codes
- Steiner systems
- Tiling
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics