Codes and Anticodes in the Grassman Graph

✍ Scribed by Moshe Schwartz; Tuvi Etzion

• Publisher: Elsevier Science
• Year: 2002
• Tongue: English
• Weight: 132 KB
• Volume: 97
• Category: Article
• ISSN: 0097-3165
• DOI: 10.1006/jcta.2001.3188

✦ Synopsis

Perfect codes and optimal anticodes in the Grassman graph G q (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.