COVERING MACHINES

被引：3

作者：

CALDERBANK, AR

机构：

[1] Mathematical Sciences Research Center, AT and T Bell Laboratories, Murray Hill

来源：

DISCRETE MATHEMATICS | 1992年 / 106卷

关键词：

D O I：

10.1016/0012-365X(92)90536-O

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We construct 2-state covering machines from binary linear codes with a sufficiently rich subcode structure. The goal is to trade multiple covering properties for increased redundancy. We explain why the expected covering properties of covering machines should be superior to those of codes obtained by iterating the ADS construction.

引用

页码：105 / 110

页数：6

共 5 条

[1] CALDERBANK AR, 1962, J COMB THEORY A, V60, P117
[2] CALDERBANK AR, 1991, 2ND MOMENT CONVOLUTI
[3] ON THE COVERING RADIUS OF CODES
GRAHAM, RL
SLOANE, NJA
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) : 385 - 401
[4] BOUNDS FOR ABNORMAL BINARY-CODES WITH COVERING RADIUS ONE
HONKALA, IS
HAMALAINEN, HO
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (02) : 372 - 375
[5] THE MINIMAL COVERING RADIUS T[15,6] OF A 6-DIMENSIONAL BINARY LINEAR CODE OF LENGTH 15 IS EQUAL TO 4
SIMONIS, J
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) : 1344 - 1345

← 1 →