On quantum codes derived from quasi-cyclic codes over a non-chain ring

IF 2.2 3区 物理与天体物理 Q1 PHYSICS, MATHEMATICAL
Shivanshu Benjwal, Maheshanand Bhaintwal, Raj Kumar
{"title":"On quantum codes derived from quasi-cyclic codes over a non-chain ring","authors":"Shivanshu Benjwal,&nbsp;Maheshanand Bhaintwal,&nbsp;Raj Kumar","doi":"10.1007/s11128-024-04514-7","DOIUrl":null,"url":null,"abstract":"<div><p>This paper presents a study on the structure of 1-generator quasi-cyclic (QC) codes over the non-chain ring <span>\\(R=\\mathbb {F}_{q}+u\\mathbb {F}_{q}+v\\mathbb {F}_{q}+uv\\mathbb {F}_{q}\\)</span>, where <span>\\(u^2=v^2=0,~ uv=vu\\)</span>, and <span>\\(\\mathbb {F}_q\\)</span> is a finite field of cardinality <span>\\(q=p^r\\)</span>; <i>p</i> is a prime. A minimal spanning set and size of these codes are determined. A sufficient condition for 1-generator QC codes over <i>R</i> to be free is given. BCH-type bounds on the minimum distance of free QC codes over <i>R</i> are also presented. Some optimal linear codes over <span>\\(\\mathbb {F}_q\\)</span> are obtained as the Gray images of quasi-cyclic codes over <i>R</i>. Some characterizations of the Gray images of QC codes over <i>R</i> in <span>\\(\\mathbb {F}_q\\)</span> and <span>\\(\\mathbb {F}_q+u\\mathbb {F}_q~(u^2=0)\\)</span> are done. As an application, we consider self-orthogonal subcodes of the Gray images of QC codes over <i>R</i> to obtain new and better quantum codes than those are available in the literature.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-08-27","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-04514-7","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents a study on the structure of 1-generator quasi-cyclic (QC) codes over the non-chain ring \(R=\mathbb {F}_{q}+u\mathbb {F}_{q}+v\mathbb {F}_{q}+uv\mathbb {F}_{q}\), where \(u^2=v^2=0,~ uv=vu\), and \(\mathbb {F}_q\) is a finite field of cardinality \(q=p^r\); p is a prime. A minimal spanning set and size of these codes are determined. A sufficient condition for 1-generator QC codes over R to be free is given. BCH-type bounds on the minimum distance of free QC codes over R are also presented. Some optimal linear codes over \(\mathbb {F}_q\) are obtained as the Gray images of quasi-cyclic codes over R. Some characterizations of the Gray images of QC codes over R in \(\mathbb {F}_q\) and \(\mathbb {F}_q+u\mathbb {F}_q~(u^2=0)\) are done. As an application, we consider self-orthogonal subcodes of the Gray images of QC codes over R to obtain new and better quantum codes than those are available in the literature.

关于从非链环上的准循环码衍生出的量子码
本文研究了非链环 \(R=\mathbb {F}_{q}+u\mathbb {F}_{q}+v\mathbb {F}_{q}+uv\mathbb {F}_{q}\)上的单发准循环(QC)码的结构、其中 \(u^2=v^2=0,~uv=vu\),并且 \(\mathbb {F}_q\) 是一个有限域,其 cardinality 为 \(q=p^r\);p 是素数。确定了这些编码的最小跨集和大小。给出了 R 上的单生成器 QC 码是自由码的充分条件。还提出了关于 R 上自由 QC 码最小距离的 BCH 型约束。作为 R 上准循环码的灰度图像,我们得到了一些最优线性码。作为应用,我们考虑了 R 上 QC 码灰色图像的自正交子码,以获得比文献中现有的更好的新量子码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信