Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (34): 88-91.
• 学术探讨 • Previous Articles Next Articles
WANG Lei1,FENG You-qian1,LI Yi-qun1,2
Received:
Revised:
Online:
Published:
Contact:
王 雷1,冯有前1,李益群1,2
通讯作者:
Abstract: The optimal quaternary self-orthogonal code reaching the bound of Griesmer is studied.By the methods of combination and the random search algorithm,the self-orthogonal code chains of short code length n(10≤n≤19) are constructed in the filed of GF(4).One result of the optimal self- orthogonal code chains with code length n(10≤n≤19) is given in this paper,and the parameters of codes in which meet the Griesmer bound.The results are important references to farther researching the construction of the self-orthogonal code chain and quantum code.
Key words: self-orthogonal code, self-orthogonal code chain, Griesmer bound
摘要: 研究了达到Griesmer界的最优自正交码。应用组合的方法和随机算法构造域F4上短码长n(10≤n≤19)的最优(或极大)自正交码及其子码链。给出了码长10≤n≤19时最优(或极大)自正交码的子码链的一种结果,其中码链中码的参数均达到了Griesmer界。这些结果对进一步研究自正交子码链及构造量子码具有重要的参考价值。
关键词: 自正交码, 自正交码链, Griesmer界
WANG Lei1,FENG You-qian1,LI Yi-qun1,2. Optimal quaternary self-orthogonal code chains of short code length[J]. Computer Engineering and Applications, 2007, 43(34): 88-91.
王 雷1,冯有前1,李益群1,2. F4上的短码长的自正交码链[J]. 计算机工程与应用, 2007, 43(34): 88-91.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2007/V43/I34/88