基于极大自正交码的S-链构造  

Construction of S-chains from maximal self-orthogonal codes

作　　者：赵学军[1] 贺筱军[1] 郭罗斌[1] 李瑞虎[1] 

机构地区：[1]空军工程大学理学院数理系,西安710051

出　　处：《计算机工程与应用》2007年第3期45-47,95,共4页Computer Engineering and Applications

基　　金：国家自然科学基金资助项目(60573040);空军工程大学理学院科研基金资助项目。

摘　　要：研究了码长n满足11≤n≤19的二元不可分解极大自正交码的对偶距离最优或拟最优的子码,以及由对偶距离最优或拟最优自正交码构造出的S-链,应用所得到的S-链构造出一些较好的量子纠错码。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.

关 键 词：自正交码 码链 量子纠错码 

分 类 号：O157.4[理学—数学] TN919.3[理学—基础数学]