Some q-ary constacyclic BCH codes with length qm+12

IF 1.2 3区 数学 Q1 MATHEMATICS
Jin Li , Huilian Zhu , Shixin Zhu
{"title":"Some q-ary constacyclic BCH codes with length qm+12","authors":"Jin Li ,&nbsp;Huilian Zhu ,&nbsp;Shixin Zhu","doi":"10.1016/j.ffa.2024.102545","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we study some <em>q</em>-ary <em>λ</em>-constacyclic BCH codes of length <span><math><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> with some large designed distances for <span><math><mrow><mi>ord</mi></mrow><mo>(</mo><mi>λ</mi><mo>)</mo><mo>=</mo><mn>2</mn></math></span> and <span><math><mn>2</mn><mo>+</mo><mo>⌈</mo><mfrac><mrow><mn>4</mn></mrow><mrow><mi>q</mi><mo>−</mo><mn>3</mn></mrow></mfrac><mo>⌉</mo><mo>≤</mo><mrow><mi>ord</mi></mrow><mo>(</mo><mi>λ</mi><mo>)</mo><mo>≤</mo><mi>q</mi><mo>−</mo><mn>1</mn></math></span> respectively, where <em>q</em> is an odd prime power and <span><math><mrow><mi>ord</mi></mrow><mo>(</mo><mi>λ</mi><mo>)</mo><mo>|</mo><mo>(</mo><mi>q</mi><mo>−</mo><mn>1</mn><mo>)</mo></math></span>. The dimensions and the lower bounds on the minimum distances of these codes are given by using recurrence relations and the introduced definitions of sequences. The code examples presented in this paper indicate that these codes have good parameters in general.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"102 ","pages":"Article 102545"},"PeriodicalIF":1.2000,"publicationDate":"2024-11-21","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/S1071579724001849","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we study some q-ary λ-constacyclic BCH codes of length qm+12 with some large designed distances for ord(λ)=2 and 2+4q3ord(λ)q1 respectively, where q is an odd prime power and ord(λ)|(q1). The dimensions and the lower bounds on the minimum distances of these codes are given by using recurrence relations and the introduced definitions of sequences. The code examples presented in this paper indicate that these codes have good parameters in general.
长度为 qm+12 的一些 qary 常环 BCH 码
本文研究了一些长度为 qm+12 的 qary λ-constacyclic BCH 码,它们在 ord(λ)=2 和 2+⌈4q-3⌉≤ord(λ)≤q-1 时分别具有一些较大的设计距离,其中 q 是奇素数幂且 ord(λ)|(q-1)。利用递推关系和引入的序列定义,给出了这些编码的维数和最小距离下限。本文介绍的编码示例表明,这些编码一般具有良好的参数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信