Additive one-rank hull codes over finite fields

IF 1.2 3区 数学 Q1 MATHEMATICS
Astha Agrawal, R.K. Sharma
{"title":"Additive one-rank hull codes over finite fields","authors":"Astha Agrawal,&nbsp;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 Fq, 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 d1[n,k]pe,M. The value of d1[n,k]pe,M for k=1,2 and n2 with respect to any duality M over any finite field Fpe is determined. Furthermore, the new quaternary one-rank hull codes are identified over non-symmetric dualities with better parameters than symmetric ones.

有限域上的加性一阶船体码
这篇文章探讨了具有一阶全局的加法编码,提出了重要的见解和构造。文章通过建立自正交元素与二次函数形式解之间的联系,介绍了一种寻找有限域上的单秩全壳码的新方法。文章还为有限域 Fq 上的任何对偶,尤其是奇数素数,提供了自正交元素的精确计数。此外,还介绍了小秩壳码的构造方法。加法一阶壳码之间可能的最大最小距离用 d1[n,k]pe,M 表示。对于任意有限域 Fpe 上的任意对偶 M,确定了 k=1,2 和 n≥2 时 d1[n,k]pe,M 的值。此外,还确定了在非对称对偶性上的新的四元一阶船体码,其参数优于对称对偶性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.00
自引率
20.00%
发文量
133
审稿时长
6-12 weeks
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信