Computer Science > Information Theory
[Submitted on 28 Apr 2024 (v1), last revised 16 Sep 2024 (this version, v2)]
Title:On completely regular self-dual codes with covering radius $ρ\leq 3$
View PDF HTML (experimental)Abstract:We give a complete classification of self-dual completely regular codes with covering radius $\rho \leq 3$. For $\rho=1$ the results are almost trivial. For $\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 $8$, and an infinite family, of length $4$, apart from the direct sum of two self-dual completely regular codes with $\rho=1$, each one. For $\rho=3$, in some cases, we use similar techniques to the ones used for $\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 $\rho=3$ and $d\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 $d\geq 3$ and $\rho=3$ is ternary and has length 12.
We provide the intersection arrays for all such codes.
Submission history
From: Joaquim Borges [view email][v1] Sun, 28 Apr 2024 06:38:00 UTC (10 KB)
[v2] Mon, 16 Sep 2024 15:15:02 UTC (18 KB)
Current browse context:
cs.IT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.