首页 | 本学科首页   官方微博 | 高级检索  
     

基于极大自正交码的S-链构造
引用本文:赵学军,贺筱军,郭罗斌,李瑞虎. 基于极大自正交码的S-链构造[J]. 计算机工程与应用, 2007, 43(3): 45-47,95
作者姓名:赵学军  贺筱军  郭罗斌  李瑞虎
作者单位:空军工程大学,理学院,数理系,西安,710051
基金项目:国家自然科学基金 , 空军工程大学校科研和校改项目
摘    要:研究了码长n满足11≤n≤19的二元不可分解极大自正交码的对偶距离最优或拟最优的子码,以及由对偶距离最优或拟最优自正交码构造出的S-链,应用所得到的S-链构造出一些较好的量子纠错码。

关 键 词:自正交码  码链  量子纠错码
文章编号:1002-8331(2007)03-0045-03
修稿时间:2006-08-01

Construction of S-chains from maximal self-orthogonal codes
ZHAO Xue-jun,HE Xiao-jun,GUO Luo-bin,LI Rui-hu. Construction of S-chains from maximal self-orthogonal codes[J]. Computer Engineering and Applications, 2007, 43(3): 45-47,95
Authors:ZHAO Xue-jun  HE Xiao-jun  GUO Luo-bin  LI Rui-hu
Abstract:In this paper,the subcodes of the binary maximal self-orthogonal codes whose length n between 11 and 19 are studied.The subcodes with optimal dual distance(or near optimal dual distance) of all indecompose maximal self-orthogonal codes are constructed by combinational method.Consequently,S-chains are constructed from these subcodes with optimal dual distance (or near optimal dual distance).And some very good quantum error-correcting codes are constructed from the S-chains obtained.
Keywords:self-orthogonal codes    S-chains   quantum error-correcting codes
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号