A family of antipodal distance-regular graphs related to the classical Preparata codes

DOI10.1023/A:1022429800058MaRDI QIDQ1898150zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 11 February 1996

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022429800058

zbMATH Keywords

automorphism groupsdistance-regular graphsPreparata codes

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Combinatorial codes (94B25)

Review text

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.

Recommendations

• On distance nonregularity of Preparata codes
• On the minimum distance graph of an extended Preparata code
• Families of nested completely regular codes and distance-regular graphs
• Distance regular covers of the complete graph
• A new distance-regular graph of diameter 3 on 1024 vertices

Cites work

• Antipodal graphs of diameter three
• Distance regular covers of the complete graph
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3733933 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• On difference matrices, resolvable transversal designs and generalized Hadamard matrices
• On the inequivalence of generalized Preparata codes
• On the Preparata and Goethals codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes

Cited in

(17)

• Three-class association schemes
• Yet another distance regular graph related to a Golay code
• Overlarge sets and partial geometries
• Uniformly packed codes and more distance regular graphs from crooked functions
• Distance regular covers of complete graphs from Latin squares
• Codes, graphs, and schemes from nonlinear functions
• On the classification of binary completely transitive codes with almost-simple top-group
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• New families of completely regular codes and their corresponding distance regular coset graphs
• Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
• On the minimum distance graph of an extended Preparata code
• On distance nonregularity of Preparata codes
• Hadamard matrices and their applications: progress 2007--2010
• Transitive (q - 1)-fold packings of PG_n(q)
• Examples of diameter-2 graphs with no triangle or \(K_{2,t}\)
• Line-parallelisms of \(\mathrm{PG}(n, 2)\) from preparata-like codes
• On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency

This page was built for publication: A family of antipodal distance-regular graphs related to the classical Preparata codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898150)