A new distance-regular graph of diameter 3 on 1024 vertices

DOI10.1007/S10623-019-00609-WMaRDI QIDQ2324787zbMATH OpenOpenAlexFDO

Authors Minjia Shi, Denis S. Krotov, Patrick Solé

Publication date 12 September 2019

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1806.07069

zbMATH Keywords

additive quaternary codescompletely regular codesdistance-regular graphsuniformly packed codes

Mathematics Subject Classification ID

Distance in graphs (05C12) Association schemes, strongly regular graphs (05E30) Linear codes (general theory) (94B05)

Abstract: The dodecacode is a nonlinear additive quaternary code of length $12$. By puncturing it at any of the twelve coordinates, we obtain a uniformly packed code of distance $5$. In particular, this latter code is completely regular but not completely transitive. Its coset graph is distance-regular of diameter three on $2^{10}$ vertices, with new intersection array $33,30,15;1,2,15$. The automorphism groups of the code, and of the graph, are determined. Connecting the vertices at distance two gives a strongly regular graph of (previously known) parameters $(2^{10},495,238,240)$. Another strongly regular graph with the same parameters is constructed on the codewords of the dual code. A non trivial completely regular binary code of length $33$ is constructed.

Recommendations

• New families of completely regular codes and their corresponding distance regular coset graphs
• Families of completely transitive codes and distance transitive graphs
• Completely regular codes with different parameters giving the same distance-regular coset graphs
• Extremal 1-codes in distance-regular graphs of diameter 3
• scientific article; zbMATH DE number 4104861

Cites work

• Completely regular codes and completely transitive codes
• Completely regular codes by concatenating Hamming codes
• Completely transitive codes in Hamming graphs
• Designs in additive codes over GF(4)
• Distance regular graphs of diameter 3 and strongly regular graphs
• Distance-regular graphs
• Fundamentals of Error-Correcting Codes
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3695090 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3497777 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Nonexistence of completely transitive codes with error-correcting capability e<3
• On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
• On automorphisms of a distance-regular graph with intersection array \(\{33,30,15;1,2,15\}\)
• Perfect codes in Doob graphs
• Quantum error correction via codes over GF(4)
• Spectra of graphs
• The Geometry of Two-Weight Codes
• The Magma algebra system. I: The user language

Cited in

(13)

• A family of antipodal distance-regular graphs related to the classical Preparata codes
• The graph of 4-ary simplex codes of dimension 2
• The homogeneous distance of \((1+u^2)\)-constacyclic codes over \(\mathbb{F}_2[u]/\langle u^3\rangle\) and its applications
• On the coset graph construction of distance-regular graphs
• Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\)
• A new family of distance-regular graphs with unbounded diameter
• On completely regular codes
• An enumeration of 1-perfect ternary codes
• Multifold 1-perfect codes
• The adjacency codes of the first yellow graphs
• Additive cyclic codes over \(\mathbb{F}_{q^3}\)
• Cyclic completely regular codes \(C_{1,5}\)
• On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher

Describes a project that uses

Uses Software

• Magma
• SageMath

This page was built for publication: A new distance-regular graph of diameter 3 on 1024 vertices

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