On completely regular self-dual codes with covering radius $\rho \leq 3$
Abstract
We give a complete classification of self-dual completely regular codes with covering radius . For the results are almost trivial. For , 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 , and an infinite family, of length , apart from the direct sum of two self-dual completely regular codes with , each one. For , in some cases, we use similar techniques to the ones used for . 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 and , 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 and 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}
}