{"title":"Additive one-rank hull codes over finite fields","authors":"Astha Agrawal, R.K. Sharma","doi":"10.1016/j.ffa.2024.102426","DOIUrl":null,"url":null,"abstract":"<div><p>This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal elements and solutions of quadratic forms. It also provides a precise count of self-orthogonal elements for any duality over the finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>, particularly odd primes. Additionally, construction methods for small rank hull codes are introduced. The highest possible minimum distance among additive one-rank hull codes is denoted by <span><math><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mo>[</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>]</mo></mrow><mrow><msup><mrow><mi>p</mi></mrow><mrow><mi>e</mi></mrow></msup><mo>,</mo><mi>M</mi></mrow></msub></math></span>. The value of <span><math><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mo>[</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>]</mo></mrow><mrow><msup><mrow><mi>p</mi></mrow><mrow><mi>e</mi></mrow></msup><mo>,</mo><mi>M</mi></mrow></msub></math></span> for <span><math><mi>k</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn></math></span> and <span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span> with respect to any duality <em>M</em> over any finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>p</mi></mrow><mrow><mi>e</mi></mrow></msup></mrow></msub></math></span> is determined. Furthermore, the new quaternary one-rank hull codes are identified over non-symmetric dualities with better parameters than symmetric ones.</p></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"96 ","pages":"Article 102426"},"PeriodicalIF":1.2000,"publicationDate":"2024-04-12","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/S1071579724000650","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal elements and solutions of quadratic forms. It also provides a precise count of self-orthogonal elements for any duality over the finite field , particularly odd primes. Additionally, construction methods for small rank hull codes are introduced. The highest possible minimum distance among additive one-rank hull codes is denoted by . The value of for and with respect to any duality M over any finite field is determined. Furthermore, the new quaternary one-rank hull codes are identified over non-symmetric dualities with better parameters than symmetric ones.
期刊介绍:
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.