Codes and anticodes in the Grassman graph (Q1604569)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1763792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Codes and anticodes in the Grassman graph |
scientific article; zbMATH DE number 1763792 |
Statements
Codes and anticodes in the Grassman graph (English)
0 references
4 July 2002
0 references
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.
0 references
perfect codes
0 references
optimal anticodes
0 references
Grassman graph
0 references
Steiner systems
0 references
0.9345622
0 references
0.91950536
0 references
0.90657586
0 references
0 references
0 references
0.8923242
0 references
