{"title":"On self-dual completely regular codes with covering radius ρ ≤ 3","authors":"J. Borges , V. Zinoviev","doi":"10.1016/j.ffa.2025.102617","DOIUrl":null,"url":null,"abstract":"<div><div>We give a complete classification of self-dual completely regular codes with covering radius <span><math><mi>ρ</mi><mo>≤</mo><mn>3</mn></math></span>. For <span><math><mi>ρ</mi><mo>=</mo><mn>1</mn></math></span> the results are almost trivial. For <span><math><mi>ρ</mi><mo>=</mo><mn>2</mn></math></span>, 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 <span><math><mi>ρ</mi><mo>=</mo><mn>1</mn></math></span>, each one. For <span><math><mi>ρ</mi><mo>=</mo><mn>3</mn></math></span>, in some cases, we use similar techniques to the ones used for <span><math><mi>ρ</mi><mo>=</mo><mn>2</mn></math></span>. 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 <span><math><mi>ρ</mi><mo>=</mo><mn>3</mn></math></span> and <span><math><mi>d</mi><mo>≥</mo><mn>3</mn></math></span>, 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 <span><math><mi>d</mi><mo>≥</mo><mn>3</mn></math></span> and <span><math><mi>ρ</mi><mo>=</mo><mn>3</mn></math></span> is ternary and has length 12.</div><div>We provide the intersection arrays for all such codes.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"105 ","pages":"Article 102617"},"PeriodicalIF":1.2000,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579725000474","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
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 8, and an infinite family, of length 4, 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.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.