Additive perfect codes in Doob graphs

DOI10.1007/s10623-018-0586-yzbMath1409.94927arXiv1806.04834OpenAlexW3099948922WikidataQ128898804 ScholiaQ128898804MaRDI QIDQ1999903

Daitao Huang, Minjia Shi, Denis S. Krotov

Publication date: 27 June 2019

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

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

zbMATH Keywords

quasi-cyclic codesdistance regular graphsDoob graphstight 2-designsadditive perfect codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

On the coset graph construction of distance-regular graphs ⋮ An enumeration of 1-perfect ternary codes ⋮ Characterizing subgroup perfect codes by 2-subgroups ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ Self-orthogonal codes over \(\mathbb{Z}_4\) arising from the chain ring \(\mathbb{Z}_4 [u / \langle u^2 + 1 \rangle \)]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect codes in Doob graphs
• Tight 2-designs and perfect 1-codes in Doob graphs
• There is exactly one \(\mathbb {Z}_2 \mathbb {Z}_4\)-cyclic 1-perfect code
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Linear and nonlinear single-error-correcting perfect mixed codes
• On the Nonexistence of Perfect Codes over Finite Fields

This page was built for publication: Additive perfect codes in Doob graphs