A note on bounds for q-ary covering codes

被引：10

作者：

Bhandari, MC

Durairajan, C

机构：

[1] Department of Mathematics, Indian Institute of Technology

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1996年 / 42卷 / 05期

关键词：

covering code; covering radius; normal codes; strongly seminormal codes; q-ary codes;

D O I：

10.1109/18.532916

中图分类号：

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

学科分类号：

0812 ;

摘要：

Two strongly seminormal codes over Z(5) are constructed to prove a conjecture of Ostergard. It is shown that a result of Honkala on (k, t)-subnormal codes holds also under weaker assumptions. A lower bound and an upper hound on K-q(n, R), the minimal, cardinality of a q-ary code of length n with covering radius R are obtained. These give improvements in seven upper hounds and twelve lower bounds by Ostergard for K-q(n, R) for q = 3, 4, and 5.

引用

页码：1640 / 1642

页数：3

共 10 条

[1] LOWER BOUNDS FOR Q-ARY COVERING CODES [J].