Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (2): 37-38.DOI: 10.3778/j.issn.1002-8331.2010.02.012

• 研究、探讨 • Previous Articles     Next Articles

Subcode chains of self-orthogonal codes with even length over GF(4)

WANG Wei-liang,LI Rui-hu   

  1. College of Science,Air Force Engineering University,Xi’an 710051,China
  • Received:2008-08-06 Revised:2008-10-28 Online:2010-01-11 Published:2010-01-11
  • Contact: WANG Wei-liang

GF(4)上偶码长自正交码的子码链

王唯良,李瑞虎   

  1. 空军工程大学 理学院,西安 710051
  • 通讯作者: 王唯良

Abstract: In this paper,self-orthogonal codes tree of given self-orthogonal codes over GF(4) is firstly constructed in order to study decreasing dimension method of generator matrix.Then subcode chains and reduced L-chains of self-dual codes whose code length n satisfies 20≤n≤30 are built up by using greedy strategy and breadth-first-search algorithm.There are 45 good quantum-error-correcting codes constructed from the obtained L-chains.

Key words: self-orthogonal code, subcode chain, L-chain, quantum-error-correcting code, greedy strategy

摘要: 基于构造自正交码码树,研究由已知自正交码构造新自正交码的生成矩阵降维方法,采用贪婪策略和BFS算法,提出可行的降维算法。对GF(4)上码长20≤n≤30的自对偶码利用降维算法构造出其子码链及导出其L-链,进而得到45个较好参数达的量子码,其中7个改进了前人所得量子码的参数。

关键词: 自正交码, 子码链, L-链, 量子纠错码, 贪婪策略

CLC Number: