ON NORMAL AND SUBNORMAL Q-ARY CODES

被引：23

作者：

LOBSTEIN, AC ^{[1
]}

VANWEE, GJM ^{[1
]}

机构：

[1] EINDHOVEN UNIV TECHNOL,DEPT MATH & COMP SCI,5600 MB EINDHOVEN,NETHERLANDS

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1989年 / 35卷 / 06期

关键词：

D O I：

10.1109/18.45285

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：1291 / 1295

页数：5

共 17 条

[1] MORE COVERINGS BY ROOK DOMAINS [J].

BLOKHUIS, A ;

LAM, CWH .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1984, 36 (02) :240-244

[2]

COHEN GD, 1986, LECT NOTES COMPUT SC, V228, P79

[3] 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

[4] ON THE COVERING RADIUS OF CODES [J].

GRAHAM, RL ;

SLOANE, NJA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) :385-401

[5]

HAMALAINEN HO, UNPUB J COMBIN THEOR

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

HONKALA, IS .

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

[7]

HONKALA IS, IN PRESS IEEE T INFO

[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 →