Maximum disjoint bases and constant-weight codes

被引：3
|
作者：
Tonchev, VD [1 ]
机构：
[1] Michigan Technol Univ, Dept Math Sci, Houghton, MI 49931 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1998年 / 44卷 / 01期
关键词：
affine geometry; constant-weight code; Steiner system;
D O I：
10.1109/18.651061
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The following lower bound for binary constant weight codes are derived by an explicit construction: A(17, 4, 5) greater than or equal to 441. The construction exploits maximal sets of bases in the four-dimensional binary vector space pairwise intersecting in at most two vectors.
引用
收藏
页码：333 / 334
页数：2
相关论文
共 50 条
12345