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

DOI10.1023/A:1022429800058zbMath0832.05100OpenAlexW1516018937MaRDI QIDQ1898150

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

distance-regular graphsautomorphism groupsPreparata codes

Mathematics Subject Classification ID

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

Related Items (11)

Overlarge sets and partial geometries ⋮ Hadamard matrices and their applications: progress 2007--2010 ⋮ 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 ⋮ On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency ⋮ Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3 ⋮ Distance regular covers of complete graphs from Latin squares ⋮ On the classification of binary completely transitive codes with almost-simple top-group ⋮ Three-class association schemes ⋮ Uniformly packed codes and more distance regular graphs from crooked functions ⋮ Codes, graphs, and schemes from nonlinear functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Antipodal graphs of diameter three
• Distance regular covers of the complete graph
• On difference matrices, resolvable transversal designs and generalized Hadamard matrices
• On the Preparata and Goethals codes
• On the inequivalence of generalized Preparata codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes

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