LOWER BOUNDS FOR Q-ARY COVERING CODES

被引：23

作者：

CHEN, W ^{[1
]}

HONKALA, IS ^{[1
]}

机构：

[1] UNIV TURKU,DEPT MATH,SF-20500 TURKU 50,FINLAND

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 03期

关键词：

D O I：

10.1109/18.54887

中图分类号：

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

学科分类号：

0812 ;

摘要：

Combinatorial lower bounds for Kq(n,R), the minimal cardinality of any q ary code of length n, and covering radius R are proven. Tables of lower bounds for Kq(n, R) are presented for q = 3,4,5. © 1990 IEEE

引用

页码：664 / 671

页数：8

共 17 条

[1]

CHEN W, 1989, KEXUE TONGBAO, V34, P631

[2] FURTHER RESULTS ON THE COVERING RADIUS OF CODES [J].

COHEN, GD ;

LOBSTEIN, AC ;

SLOANE, NJA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (05) :680-694

[3]

HAMALAINEN H, IN PRESS J COMB TH A

[4]

HAMALAINEN HO, COMMUNICATION

[5] LOWER BOUNDS FOR BINARY COVERING CODES [J].

HONKALA, IS .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) :326-329

[6]

HONKALA IS, IN PRESS IEEE T INFO

[7]

HONKALA IS, UNPUB

[8]

KALBFLEISCH JG, 1969, J LONDON MATH SOC, V1, P398

[9]

KALBFLEISCH JG, 1969, J LOND MATH SOC, V44, P60

[10]

KAMPS HJL, 1967, J COMB THEORY, V3, P315

← 1 2 →