NEW MINIMUM DISTANCE BOUNDS FOR CERTAIN BINARY LINEAR CODES

被引：2

作者：

DASKALOV, RN

KAPRALOV, SN

机构：

[1] Department of Mathematics, Technical University

来源：

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

关键词：

BINARY LINEAR CODE; MINIMUM DISTANCE BOUND;

D O I：

10.1109/18.165453

中图分类号：

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

学科分类号：

0812 ;

摘要：

The nonexistence of binary linear [n, k, d]-codes having the parameters [119, 11, 56], [104, 12, 48], [99, 14, 44], [116, 15, 52], [124, 15, 56], [109, 16, 48], [43, 17, 14], [47, 17, 16], [56, 18, 201, [61, 19, 22], [65, 19, 24], [73, 19, 28], [89, 19, 36], [82, 20, 32], [124, 22, 52], [118, 24, 48], [56, 29, 14], [69, 30, 20], [89, 30, 30], [93, 30, 32], [62, 31, 16], [74, 31, 22], [86, 31, 28], [102, 31, 36], [80, 33, 24], [120, 33, 44], [108,44,32], [117, 45, 36], [105, 49, 28] is proven and as a consequence more than 400 minimum distance upper bounds in Verhoeff's table have been improved.

引用

页码：1795 / 1796

页数：2

共 50 条

[21] Improved Linear Programming Decoding and Bounds on the Minimum Distance of LDPC Codes
Burshtein, David
Goldenberg, Idan
2010 IEEE INFORMATION THEORY WORKSHOP (ITW), 2010,
[22] Bounds on the minimum distance of Goppa codes
Maharaj, Hiren
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (07) : 3256 - 3259
[23] Minimum Distance Bounds for Expander Codes
Skachek, Vitaly
2008 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2008, : 409 - 413
[24] BOUNDS ON THE MINIMUM DISTANCE OF TRELLIS CODES
BURNASHEV, M
BIGLIERI, EM
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (03) : 659 - 662
[25] Some bounds for the minimum length of binary linear codes of dimension nine
Bouyukliev, I
Guritman, S
Vavrek, V
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (03) : 1053 - 1056
[26] New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds
Eric Zhi Chen
Designs, Codes and Cryptography, 2016, 80 : 1 - 10
[27] New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds
Chen, Eric Zhi
DESIGNS CODES AND CRYPTOGRAPHY, 2016, 80 (01) : 1 - 10
[28] On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes
Laihonen T.
Litsyn S.
Designs, Codes and Cryptography, 1998, 14 (1) : 71 - 80
[29] On upper bounds for minimum distance and covering radius of non-binary codes
Laihonen, Tero
Litsyn, Simon
Designs, Codes, and Cryptography, 1998, 14 (01): : 71 - 80
[30] NEW BOUNDS ON BINARY LINEAR CODES OF DIMENSION 8
DODUNEKOV, SM
HELLESETH, T
MANEV, N
YTREHUS, O
IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (06) : 917 - 919

← 1 2 3 4 5 →