An improved upper bound on the minimum distance of doubly-even self-dual codes

被引:8
|
作者
Krasikov, I [1 ]
Litsyn, S
机构
[1] Tel Aviv Univ, Sch Math Sci, IL-69978 Tel Aviv, Israel
[2] Beit Berl Coll, Kfar Sava, Israel
[3] Tel Aviv Univ, Dept Elect Engn Syst, IL-69978 Tel Aviv, Israel
关键词
distance distribution; self-dual codes; upper bounds;
D O I
10.1109/18.817527
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We derive a new upper bound on the minimum distance d of doubly-even self-dual codes of length n. Asymptotically, for n growing, it gives lim(n-->infinity) sup d/n less than or equal to (5 - 5(3/4))/10 < 0.165630, thus improving on the Mallows-Odlyzko-Sloane bound of 1/6 and our recent bound of 0,166315.
引用
收藏
页码:274 / 278
页数:5
相关论文
共 50 条