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 条

[41] New minimum distance bounds for linear codes over GF(5)
Daskalov, R
Hristov, P
Metodieva, E
DISCRETE MATHEMATICS, 2004, 275 (1-3) : 97 - 110
[42] New Minimum Distance Bounds for Linear Codes over GF(9)
R. Daskalov
E. Metodieva
P. Hristov
Problems of Information Transmission, 2004, 40 (1) : 13 - 24
[43] AN UPDATED TABLE OF MINIMUM-DISTANCE BOUNDS FOR BINARY LINEAR CODES
BROUWER, AE
VERHOEFF, T
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (02) : 662 - 677
[44] On the minimum distance of turbo codes
Truhachev, D
Lentmaier, M
Wintzell, O
Zigangirov, KS
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 84 - 84
[45] ON THE MINIMUM DISTANCE OF CYCLIC CODES
VANLINT, JH
WILSON, RM
IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (01) : 23 - 40
[46] MINIMUM DISTANCE OF ELLIPTIC CODES
SHOKROLLAHI, MA
ADVANCES IN MATHEMATICS, 1992, 93 (02) : 251 - 281
[47] MINIMUM POLARIZED DISTANCE CODES
MARCUS, MP
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1961, 5 (03) : 241 - 248
[48] ON THE MINIMUM DISTANCE OF COMBINATORIAL CODES
TOLHUIZEN, L
VANLINT, JH
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (04) : 922 - 923
[49] On the minimum distance of Castle codes
Olaya-Leon, Wilson
Munuera, Carlos
FINITE FIELDS AND THEIR APPLICATIONS, 2013, 20 : 55 - 63
[50] On the minimum distance of array codes as LDPC codes
Yang, KC
Helleseth, T
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (12) : 3268 - 3271

← 1 2 3 4 5 →