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
关键词
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 条
  • [41] COURTSHIP AND LINEAR-PROGRAMMING
    ABELEDO, HG
    ROTHBLUM, UG
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1995, 216 : 111 - 124
  • [42] ASYMPTOTIC LINEAR-PROGRAMMING
    JEROSLOW, RG
    OPERATIONS RESEARCH, 1973, 21 (05) : 1128 - 1141
  • [43] STOCHASTIC LINEAR-PROGRAMMING
    VANMOESEKE, P
    YALE ECONOMIC ESSAYS, 1965, 5 (01): : 197 - 253
  • [44] LINEAR-PROGRAMMING ON TRANSPUTERS
    LUO, J
    REIJNS, GL
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 525 - 534
  • [45] LIMITATIONS OF LINEAR-PROGRAMMING
    KOEHLER, JE
    SLIGHTON, RL
    JOURNAL OF MEDICAL EDUCATION, 1974, 49 (03): : 315 - 315
  • [46] LINEAR-PROGRAMMING ON MICROCOMPUTERS
    MCKAY, A
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1983, 34 (04) : 355 - 358
  • [47] A LOWER BOUND ON THE MULTIVARIABLE STABILITY MARGIN VIA LINEAR-PROGRAMMING
    SIDERIS, A
    PROCEEDINGS OF THE 28TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-3, 1989, : 1936 - 1937
  • [48] A Linear Programming Bound for Unequal Error Protection Codes
    Saito, Tomohiko
    Ukita, Yoshifumi
    Matsushima, Toshiyasu
    Hirasawa, Shigeichi
    2010 AUSTRALIAN COMMUNICATIONS THEORY WORKSHOP, 2010, : 24 - +
  • [49] SCHOOL TIMETABLING - A CASE IN LARGE BINARY INTEGER LINEAR-PROGRAMMING
    TRIPATHY, A
    MANAGEMENT SCIENCE, 1984, 30 (12) : 1473 - 1489
  • [50] On Delsarte's linear programming bounds for binary codes
    Navon, M
    Samorodnitsky, A
    46th Annual IEEE Symposium on Foundations of Computer Science, Proceedings, 2005, : 327 - 336