摘要
基于构造自正交码码树,研究由已知自正交码构造新自正交码的生成矩阵降维方法,采用贪婪策略和BFS算法,提出可行的降维算法。对GF(4)上码长20≤n≤30的自对偶码利用降维算法构造出其子码链及导出其L-链,进而得到45个较好参数达的量子码,其中7个改进了前人所得量子码的参数。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第2期37-38,54,共3页
Computer Engineering and Applications
基金
国家自然科学基金(No.60573040)
空军工程大学理学院科研基金~~
关键词
自正交码
子码链
L-链
量子纠错码
贪婪策略
self-orthogonal code
subcode chain
L-chain
quantum-error-correcting code
greedy strategy
