English

On completely regular self-dual codes with covering radius $\rho \leq 3$

Information Theory 2024-09-17 v2 math.IT

Abstract

We give a complete classification of self-dual completely regular codes with covering radius ρ3\rho \leq 3. For ρ=1\rho=1 the results are almost trivial. For ρ=2\rho=2, by using properties of the more general class of uniformly packed codes in the wide sense, we show that there are two sporadic such codes, of length 88, and an infinite family, of length 44, apart from the direct sum of two self-dual completely regular codes with ρ=1\rho=1, each one. For ρ=3\rho=3, in some cases, we use similar techniques to the ones used for ρ=2\rho=2. However, for some other cases we use different methods, namely, the Pless power moments which allow to us to discard several possibilities. We show that there are only two self-dual completely regular codes with ρ=3\rho=3 and d3d\geq 3, which are both ternary: the extended ternary Golay code and the direct sum of three ternary Hamming codes of length 4. Therefore, any self-dual completely regular code with d3d\geq 3 and ρ=3\rho=3 is ternary and has length 12. We provide the intersection arrays for all such codes.

Keywords

Cite

@article{arxiv.2404.18088,
  title  = {On completely regular self-dual codes with covering radius $\rho \leq 3$},
  author = {J. Borges and V. A. Zinoviev},
  journal= {arXiv preprint arXiv:2404.18088},
  year   = {2024}
}
R2 v1 2026-06-28T16:08:47.524Z