BOUNDS FOR ABNORMAL BINARY-CODES WITH COVERING RADIUS ONE

被引：8

作者：

HONKALA, IS

HAMALAINEN, HO

机构：

[1] Department of Mathematics, University of Turku, 20500

[2] Haukkamäentie 5 A 10, 40220, Keskipalokka

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 02期

关键词：

COVERING RADIUS; COVERING CODE; NORMAL AND ABNORMAL CODES;

D O I：

10.1109/18.75256

中图分类号：

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

学科分类号：

0812 ;

摘要：

It is shown that if an (n,M)1 code (a binary code of length n with M codewords and covering radius 1) is abnormal then n greater-than-or-equal-to 9 and M greater-than-or-equal-to 96, and an abnormal (9, 118)1 code is constructed. Lower bounds on the minimum cardinality of abnormal (n,M)1 codes are derived. If an (n,M)1 code is abnormal, then it is shown that M greater-than-or-equal-to K(n,1) + n.

引用

页码：372 / 375

页数：4

共 10 条

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