A geometric approach to finding new lower bounds of A (n, d, w)

被引：4
|
作者：
Gashkov, I. [1 ]
Ekberg, J. A. O. [1 ]
Taub, D. [1 ]
机构：
[1] Karlstad Univ, Dept Math, Karlstad, Sweden
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2007年 / 43卷 / 2-3期
关键词：
constant weight code;
D O I：
10.1007/s10623-007-9064-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Certain classes of binary constant weight codes can be represented geometrically using linear structures in Euclidean space. The geometric treatment is concerned mostly with codes with minimum distance 2(w - 1), that is, where any two codewords coincide in at most one entry; an algebraic generalization of parts of the theory also applies to some codes without this property. The presented theorems lead to several improvements of the tables of lower bounds on A (n, d, w) maintained by E. M. Rains and N. J. A. Sloane, and the ones recently published by D. H. Smith, L. A. Hughes and S. Perkins. Some of these new codes can be proven optimal.
引用
收藏
页码：85 / 91
页数：7
相关论文
共 50 条
12345