A NEW UPPER BOUND ON NONBINARY BLOCK-CODES

被引：39
作者：
AALTONEN, M
机构：
[1] Department of Mathematics, University of Turku
来源：
DISCRETE MATHEMATICS | 1990年 / 83卷 / 2-3期
关键词：
D O I：
10.1016/0012-365X(90)90002-Y
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An upper bound on the information rate of nonbinary block codes is derived via linear programming in the nonbinary Johnson scheme. Combined with the general cross-section method this new result gives the best presently known asymptotic upper bound on nonbinary block codes. © 1990.
引用
收藏
页码：139 / 160
页数：22
相关论文
共 21 条
[1]  
Aaltonen M., 1977, IEEE T INFORM THEORY, V25, P85
[2]   NOTES ON THE ASYMPTOTIC-BEHAVIOR OF THE INFORMATION RATE OF BLOCK-CODES [J].
AALTONEN, MJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (01) :84-85
[3]  
AALTONEN MJ, 1981, ANN U TURKU A1, V181
[4]  
ASKEY R, 1975, SIAM REGIONAL C SER, V21
[5]  
BERLEKAMP ER, 1968, ALGEBRAIC CODING THE
[6]  
DELSARTE P, 1973, PHILIPS RES REP S, V10
[7]  
ELIAS P, UNPUB
[8]   A COMPARISON OF SIGNALLING ALPHABETS [J].
GILBERT, EN .
BELL SYSTEM TECHNICAL JOURNAL, 1952, 31 (03) :504-522
[9]   ERROR DETECTING AND ERROR CORRECTING CODES [J].
HAMMING, RW .
BELL SYSTEM TECHNICAL JOURNAL, 1950, 29 (02) :147-160
[10]   MINIMAL REDUNDANCY OF BINARY ERROR-CORRECTING CODES [J].
LEVENSHTEIN, VI .
INFORMATION AND CONTROL, 1975, 28 (04) :268-291
123