SOME NEW LOWER BOUNDS FOR BINARY AND TERNARY COVERING CODES

被引：9

作者：

VANWEE, GJM

机构：

[1] Philips Research Laboratories, 5600, JA Eindhoven

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1993年 / 39卷 / 04期

关键词：

COVERINGS; COVERING CODES; COVERING RADIUS; FOOTBALL POOL PROBLEM; ROOK DOMAINS;

D O I：

10.1109/18.243462

中图分类号：

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

学科分类号：

0812 ;

摘要：

The main result is a modified lower bound for binary codes with covering radius one. Let K(q)(n, R) denote the minimum cardinality of a q-ary code with covering radius R. The new bound shows that K2(11, 1) greater-than-or-equal-to 177 and that K2(17, 1) greater-than-or-equal-to 7391, improvements of the best lower bounds known. We also generalize a known lower bound for binary codes to the case of arbitrary q. For q = 3, this simple bound improves the best lower bounds known in several cases. An updated version of a table for K3(n, R) is included.

引用

页码：1422 / 1424

页数：3

共 26 条

[1] BINARY-CODES WITH A MINIMUM DISTANCE OF 4 [J].