Quasi-perfect codes with small distance

The main purpose of this paper is to give bounds on the length of the shortest and longest binary quasi-perfect codes with a given Hamming distance, covering radius, and redundancy. We consider codes with Hamming distance 4 and 5 and covering radius 2 and 3, respectively. We discuss the blockwise direct sum (BDS) construction which has an important role in finding these bounds.

[1]  A. A. Davydov,et al.  Constructions, families, and tables of binary linear covering codes , 1994, IEEE Trans. Inf. Theory.

[2]  Iiro S. Honkala,et al.  On (k, t) -subnormal covering codes , 1991, IEEE Trans. Inf. Theory.

[3]  Terry J. Wagner,et al.  A Search Technique for Quasi-Perfect Codes , 1966, Inf. Control..

[4]  Richard M. Wilson,et al.  Short codes with a given coveting radius , 1989, IEEE Trans. Inf. Theory.

[5]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[6]  N. J. A. Sloane,et al.  New binary codes , 1972, IEEE Trans. Inf. Theory.

[7]  Gérard D. Cohen,et al.  Covering Codes , 2005, North-Holland mathematical library.

[8]  Neal Zierler,et al.  Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect , 1960, Inf. Control..

[9]  K. T. Phelps,et al.  A Combinatorial Construction of Perfect Codes , 1983 .

[10]  T. Etzion,et al.  Constructions for perfect mixed codes and other covering codes , 1993, IEEE Trans. Inf. Theory.

[11]  Ernst M. Gabidulin,et al.  Linear codes with covering radius 2 and other new covering codes , 1991, IEEE Trans. Inf. Theory.