A class of constacyclic BCH codes of length \(n=\frac{q^{2m}-1}{2\left( q^2-1\right) }\) and related quantum codes

IF 2.2 3区 物理与天体物理 Q1 PHYSICS, MATHEMATICAL
Jiayuan Zhang, Xiaoshan Kai, Ping Li, Shixin Zhu
{"title":"A class of constacyclic BCH codes of length \\(n=\\frac{q^{2m}-1}{2\\left( q^2-1\\right) }\\) and related quantum codes","authors":"Jiayuan Zhang,&nbsp;Xiaoshan Kai,&nbsp;Ping Li,&nbsp;Shixin Zhu","doi":"10.1007/s11128-024-04605-5","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, a class of narrow-sense constacyclic BCH codes over <span>\\(\\mathbb {F}_{q^2}\\)</span> with length <span>\\(n=\\frac{q^{2m}-1}{2\\left( q^2-1\\right) }\\)</span> is studied, where <span>\\(q\\ge 3\\)</span> is an odd prime power and <span>\\(m\\ge 2\\)</span> is even. The maximum designed distance such that narrow-sense constacyclic BCH codes over <span>\\(\\mathbb {F}_{q^2}\\)</span> with length <i>n</i> containing their Hermitian dual codes is determined. We obtain some new quantum codes by using such narrow-sense constacyclic BCH codes. Our constructions not only have larger designed distance but also have better parameters than the ones in the literature.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 12","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-024-04605-5","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, a class of narrow-sense constacyclic BCH codes over \(\mathbb {F}_{q^2}\) with length \(n=\frac{q^{2m}-1}{2\left( q^2-1\right) }\) is studied, where \(q\ge 3\) is an odd prime power and \(m\ge 2\) is even. The maximum designed distance such that narrow-sense constacyclic BCH codes over \(\mathbb {F}_{q^2}\) with length n containing their Hermitian dual codes is determined. We obtain some new quantum codes by using such narrow-sense constacyclic BCH codes. Our constructions not only have larger designed distance but also have better parameters than the ones in the literature.

一类长度为\(n=\frac{q^{2m}-1}{2\left( q^2-1\right) }\)的恒循环BCH码及其相关量子码
研究了\(\mathbb {F}_{q^2}\)上一类长度为\(n=\frac{q^{2m}-1}{2\left( q^2-1\right) }\)的狭义常环BCH码,其中\(q\ge 3\)为奇素数幂,\(m\ge 2\)为偶素数幂。确定了长度为n的\(\mathbb {F}_{q^2}\)上的狭义恒环BCH码包含厄米对偶码的最大设计距离。利用这种狭义常环BCH码,我们得到了一些新的量子码。我们的结构不仅具有更大的设计距离,而且具有比文献中更好的参数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Quantum Information Processing
Quantum Information Processing 物理-物理:数学物理
CiteScore
4.10
自引率
20.00%
发文量
337
审稿时长
4.5 months
期刊介绍: Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.
×
引用
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学术官方微信