Codes and Anticodes in the Grassman Grap
β
Moshe Schwartz; Tuvi Etzion
π
Article
π
2002
π
Elsevier Science
π
English
β 132 KB
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