Quantum Codes of Minimum Distance Three Constructed from Binary Codes of Odd Length

Ruihu Li, Gang Chen
{"title":"Quantum Codes of Minimum Distance Three Constructed from Binary Codes of Odd Length","authors":"Ruihu Li, Gang Chen","doi":"10.1109/ICFN.2010.20","DOIUrl":null,"url":null,"abstract":"We give elementary recursive constructions of a pair of nested binary self-orthogonal codes with dual distance two and three for all odd .Consequently, good quantum codes of minimum distance three for such length are obtained via Steane’s construction. Such quantum codes were explicitly constructed before only for a sparse set of lengths.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Future Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICFN.2010.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We give elementary recursive constructions of a pair of nested binary self-orthogonal codes with dual distance two and three for all odd .Consequently, good quantum codes of minimum distance three for such length are obtained via Steane’s construction. Such quantum codes were explicitly constructed before only for a sparse set of lengths.
由奇数二进制码构造最小距离3的量子码
我们给出了对所有奇数都具有对偶距离为2和3的嵌套二进制自正交码的初等递推构造,从而通过Steane构造得到了这种长度的最小距离为3的良好量子码。在此之前,这种量子码被明确地构造为一个稀疏的长度集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信