A BOUND FOR DIVISIBLE CODES

被引：17

作者：

WARD, HN

机构：

[1] Department of Mathematics, Math-Astronomy Building, University of Virginia, Charlottesville

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1992年 / 38卷 / 01期

关键词：

DIVISIBLE CODES; SELF-DUAL CODES; BOUNDS;

D O I：

10.1109/18.108271

中图分类号：

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

学科分类号：

0812 ;

摘要：

A divisible code is a linear code whose word weights have a common divisor larger than one. If the divisor is a power of the field characteristic, there is a simple bound on the dimension of the code in terms of its weight range. When this bound is applied to the subcode of words with weight divisible by four in a type I binary self-dual code, it yields an asymptotic improvement of the Conway-Sloane bound for self-dual codes.

引用

页码：191 / 194

页数：4

共 11 条

[1]

BONISOLI A, 1983, ARS COMBINATORIA, V18, P181

[2]

Conway J. H., 1988, SPHERE PACKINGS LATT

[3] A NEW UPPER BOUND ON THE MINIMAL DISTANCE OF SELF-DUAL CODES [J].