THE LINEAR-PROGRAMMING BOUND FOR BINARY LINEAR CODES

被引：14
|
作者：
BROUWER, AE
机构：
[1] Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600, MB, Eindhoven
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1993年 / 39卷 / 02期
关键词：
BINARY LINEAR CODE; UPPER BOUND;
D O I：
10.1109/18.212302
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Combining Delsarte's linear programming bound with the information that certain weights cannot occur, new upper bounds for d(min) (n, k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived.
引用
收藏
页码：677 / 680
页数：4
相关论文
共 50 条
12345