Codes and anticodes in the Grassman graph

Moshe Schwartz, Tuvi Etzion

Research output: Contribution to journalArticlepeer-review

70 Scopus citations


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 languageEnglish
Pages (from-to)27-42
Number of pages16
JournalJournal of Combinatorial Theory. Series A
Issue number1
StatePublished - 1 Jan 2002
Externally publishedYes


  • Anticodes
  • Codes
  • Steiner systems
  • Tiling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Codes and anticodes in the Grassman graph'. Together they form a unique fingerprint.

Cite this