Work

On self-dual completely regular codes with covering radius ρ ≤ 3

Year: 2025

Type: article

Abstract: We give a complete classification of self-dual completely regular codes with covering radius ρ ≤ 3 . For ρ = 1 the results are almost trivial. For ρ = 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 ρ = 1 , each one. For ρ = 3 , in some cases, we use similar techniques to the ones used for ρ = 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 and d ≥ 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 ≥ 3 and ρ = 3 is ternary and has length 12. We provide the intersection arrays for all such codes.

Source: Finite Fields and Their Applications

DOI: 10.1016/j.ffa.2025.102617

Authors: J. Borges, V. Zinoviev

Institutions: Universitat Autònoma de Barcelona, Russian Academy of Sciences, Moscow Institute of Physics and Technology, Institute for Information Transmission Problems

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,720

Funders: Ministerio de Ciencia e Innovación, Russian Academy of Sciences, Agència de Gestió d'Ajuts Universitaris i de Recerca, Agencia Estatal de Investigación