The Existence of Perfect Codes in Doob Graphs

DOI10.1109/TIT.2019.2946612MaRDI QIDQ5123795zbMATH OpenFDO

Authors Denis S. Krotov

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: We solve the problem of existence of perfect codes in the Doob graph. It is shown that 1-perfect codes in the Doob graph D(m,n) exist if and only if 6m+3n+1 is a power of 2; that is, if the size of a 1-ball divides the number of vertices. Keywords: perfect codes, distance-regular graphs, Doob graphs, Eisenstein-Jacobi integers.

Cited in

(5)

• Distance-2 MDS codes and Latin colorings in the Doob graphs
• The existence of perfect codes in a family of generalized Fibonacci cubes
• On the non-existence of extended 1-perfect codes and MDS codes
• Subgroup Perfect Codes in Cayley Graphs
• Characterizing subgroup perfect codes by 2-subgroups

This page was built for publication: The Existence of Perfect Codes in Doob Graphs

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