Codes and anticodes in the Grassman graph
The authors examine perfect codes and optimal anticodes in the Grassman graph \(G_q(n, k)\). It is shown that the vertices of the Grassman graph cannot be partitioned into optimal anticodes, with a possible exception when \(n= 2k\). Properties of diameter perfect codes in the graph are also examined. These codes are known to be similar to Steiner systems. Connections between these systems and ``real'' Steiner systems are discussed.
scientific article; zbMATH DE number 1763792