On computing the minimum distance of linear codes

被引：0

作者：

Mohri, Masami ^{[1
]}

Morii, Masakatu ^{[2
]}

机构：

[1] Dept. of Mgmt. and Info. Processing, Kagawa Junior College, Kagawa, 769-0201, Japan

[2] Dept. Info. Sci. Intelligent Syst., Faculty of Engineering, University of Tokushima, Tokushima, 770-8506, Japan

来源：

Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi) | 2000年 / 83卷 / 11期

关键词：

D O I：

10.1002/(SICI)1520-6440(200011)83:113.0.CO;2-0

中图分类号：

学科分类号：

摘要：

引用

页码：32 / 42

共 50 条

[31] Computing the minimum distances of linear codes by the error impulse method
Berrou, C
Vaton, S
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 5 - 5
[32] Heapmod algorithm for computing the minimum free distance of convolutional codes.
David, O
Lyandres, V
21ST IEEE CONVENTION OF THE ELECTRICAL AND ELECTRONIC ENGINEERS IN ISRAEL - IEEE PROCEEDINGS, 2000, : 435 - 438
[33] The Feng-Rao designed minimum distance of binary linear codes and cyclic codes
Zheng, J
Kaida, T
Imamura, K
ADVANCED SIGNAL PROCESSING FOR COMMUNICATION SYSTEMS, 2002, 703 : 167 - 182
[34] Graph theoretic aspects of minimum distance and equivalence of binary linear codes
Mallik, Sudipta
Yildiz, Bahattin
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2021, 79 : 515 - 526
[35] Some results for linear binary codes with minimum distance 5 and 6
Bouyukliev, I
Varbanov, Z
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) : 4387 - 4391
[36] Improved Linear Programming Decoding and Bounds on the Minimum Distance of LDPC Codes
Burshtein, David
Goldenberg, Idan
2010 IEEE INFORMATION THEORY WORKSHOP (ITW), 2010,
[37] MAXIMAL Q-NARY LINEAR CODES WITH LARGE MINIMUM DISTANCE
PATEL, AM
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (01) : 106 - 110
[38] AN UPDATED TABLE OF MINIMUM-DISTANCE BOUNDS FOR BINARY LINEAR CODES
VERHOEFF, T
IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (05) : 665 - 680
[39] New Minimum Distance Bounds for Linear Codes over Small Fields
R. N. Daskalov
T. A. Gulliver
Problems of Information Transmission, 2001, 37 (3) : 206 - 215
[40] Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes
Yasunaga, Kenji
Fujiwara, Toru
2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 975 - +

← 1 2 3 4 5 →