Shadow bounds for self-dual codes

被引：165

作者：

Rains, EM ^{[1
]}

机构：

[1] AT&T Bell Labs, Res, Florham Park, NJ 07932 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1998年 / 44卷 / 01期

关键词：

bound; self-dual code; shadow; singly-even;

D O I：

10.1109/18.651000

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Conway and Sloane have previously given an upper bound on the minimum distance of a singly-even self-dual binary code, using the concept of the shadow of a self-dual code. We improve their bound, finding that the minimum distance of a self-dual binary code of length n is at most 4[n/24] + 4, except when n mod 24 = 22, when the bound is 4[n/24] + 6. We also show that a code of length a multiple of 24 meeting the bound cannot be singly-el en. The same technique gives similar results for additive codes over GF (4) (relevant to quantum coding theory).

引用

页码：134 / 139

页数：6