A family of antipodal distance-regular graphs related to the classical Preparata codes (Q1898150): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On the Preparata and Goethals codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antipodal graphs of diameter three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance regular covers of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On difference matrices, resolvable transversal designs and generalized Hadamard matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inequivalence of generalized Preparata codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921240 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1022429800058 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1516018937 / rank
 
Normal rank

Latest revision as of 10:11, 30 July 2024

scientific article
Language Label Description Also known as
English
A family of antipodal distance-regular graphs related to the classical Preparata codes
scientific article

    Statements

    A family of antipodal distance-regular graphs related to the classical Preparata codes (English)
    0 references
    0 references
    11 February 1996
    0 references
    The authors construct a new family of distance-regular graphs which are related to the classical Preparata codes and determine their automorphism groups. The new DRGs are antipodal \(2^{2t- 1}\)-fold covers of the complete graph on \(2^{2t}\) vertices; see \textit{A. E. Brouwer}, \textit{A. M. Cohen} and \textit{A. Neumaier} [Distance-regular graphs (1989; Zbl 0747.05073)] for background.
    0 references
    distance-regular graphs
    0 references
    Preparata codes
    0 references
    automorphism groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references