Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (3): 45-45.

• 学术探讨 • Previous Articles     Next Articles

Construction of S-chains From Maximal Self-orthogonal Codes

XueJun Zhao XiaoJun He LuoBin Guo RuiHu Li   

  • Received:2006-05-30 Revised:1900-01-01 Online:2007-01-21 Published:2007-01-21
  • Contact: XueJun Zhao

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

赵学军 贺筱军 郭罗斌 李瑞虎   

  1. 空军工程大学理学院数理系
  • 通讯作者: 赵学军

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.

Key words: S-chains, Self-orthogonal Codes, Quantum Error-correcting Codes

摘要: 研究了码长n满足 的二元不可分解极大自正交码的对偶距离最优或拟最优的子码, 以及由对偶距离最优或拟最优自正交码构造出的 链,应用所得到的 链构造出一些较好的量子纠错码。

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