Codes and anticodes in the Grassman graph (Q1604569): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcta.2001.3188 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996897280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfect codes and related concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nonexistence of Perfect Codes in the Johnson Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect byte-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Ko-Rado theorem for vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anticodes for the Grassmann and bilinear forms graphs / rank
 
Normal rank

Latest revision as of 10:34, 4 June 2024

scientific article
Language Label Description Also known as
English
Codes and anticodes in the Grassman graph
scientific article

    Statements

    Codes and anticodes in the Grassman graph (English)
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references