一般非链环上的恒环码的新量子码

IF 0.6 Q4 MATHEMATICS, APPLIED Discrete Mathematics Algorithms and Applications Pub Date : 2023-09-27 DOI:10.1142/s1793830923500726
Swati Bhardwaj, Mokshi Goyal, Madhu Raka
{"title":"一般非链环上的恒环码的新量子码","authors":"Swati Bhardwaj, Mokshi Goyal, Madhu Raka","doi":"10.1142/s1793830923500726","DOIUrl":null,"url":null,"abstract":"Let [Formula: see text] be a prime power and let [Formula: see text] be a finite non-chain ring, where [Formula: see text], are polynomials, not all linear, which split into distinct linear factors over [Formula: see text]. We characterize constacyclic codes over the ring [Formula: see text] and study quantum codes from these. As an application, some new and better quantum codes, as compared to the best known codes, are obtained. We also prove that the choice of the polynomials [Formula: see text], [Formula: see text], is irrelevant while constructing quantum codes from constacyclic codes over [Formula: see text], it depends only on their degrees.","PeriodicalId":45568,"journal":{"name":"Discrete Mathematics Algorithms and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New quantum codes from constacyclic codes over a general non-chain ring\",\"authors\":\"Swati Bhardwaj, Mokshi Goyal, Madhu Raka\",\"doi\":\"10.1142/s1793830923500726\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let [Formula: see text] be a prime power and let [Formula: see text] be a finite non-chain ring, where [Formula: see text], are polynomials, not all linear, which split into distinct linear factors over [Formula: see text]. We characterize constacyclic codes over the ring [Formula: see text] and study quantum codes from these. As an application, some new and better quantum codes, as compared to the best known codes, are obtained. We also prove that the choice of the polynomials [Formula: see text], [Formula: see text], is irrelevant while constructing quantum codes from constacyclic codes over [Formula: see text], it depends only on their degrees.\",\"PeriodicalId\":45568,\"journal\":{\"name\":\"Discrete Mathematics Algorithms and Applications\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s1793830923500726\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1793830923500726","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

设[公式:见文]是一个素数幂,设[公式:见文]是一个有限的非链环,其中[公式:见文]是多项式,不全是线性的,它们在[公式:见文]上分裂成不同的线性因子。我们描述了环上的恒环码[公式:见文本],并从中研究量子码。作为一种应用,与已知的量子码相比,获得了一些新的、更好的量子码。我们还证明了多项式的选择[公式:见文],[公式:见文],在从[公式:见文]上的恒环码构造量子码时是无关的,它只取决于它们的度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
New quantum codes from constacyclic codes over a general non-chain ring
Let [Formula: see text] be a prime power and let [Formula: see text] be a finite non-chain ring, where [Formula: see text], are polynomials, not all linear, which split into distinct linear factors over [Formula: see text]. We characterize constacyclic codes over the ring [Formula: see text] and study quantum codes from these. As an application, some new and better quantum codes, as compared to the best known codes, are obtained. We also prove that the choice of the polynomials [Formula: see text], [Formula: see text], is irrelevant while constructing quantum codes from constacyclic codes over [Formula: see text], it depends only on their degrees.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.50
自引率
41.70%
发文量
129
期刊最新文献
Surveying the Landscape of Text Summarization with Deep Learning: A Comprehensive Review Total Chromatic Number for Certain Classes of Product Graphs Strong Nonsplit domsaturation number of a graph Some results on a supergraph of the sum annihilating ideal graph of a commutative ring On the study of rainbow antimagic connection number of comb product of tree and complete bipartite graph
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1