{"title":"由奇数二进制码构造最小距离3的量子码","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":"{\"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}","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}
Quantum Codes of Minimum Distance Three Constructed from Binary Codes of Odd Length
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
