Constructions for perfect mixed codes and other covering codes

A construction for an infinite family of perfect mixed codes with covering radius 2 is presented. These are the first known nontrivial perfect mixed codes with covering radius greater than 1. Based on mixed codes, constructions for binary covering codes that lead to a considerable improvement of upper bounds on the sizes of covering codes are presented. These codes and some other codes can be obtained by the blockwise direct sum construction. Two infinite families of codes are of special interest. They are quasi-perfect, nonlinear, union of their disjoint translates covers the space, and their density as covering codes is remarkably low. >

[1]  Zhen Zhang,et al.  Linear inequalities for covering codes: Part I: Pair covering inequalities , 1991, IEEE Trans. Inf. Theory.

[2]  Iiro S. Honkala,et al.  Normal and abnormal codes , 1993, IEEE Trans. Inf. Theory.

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

[4]  N. J. A. Sloane,et al.  Further results on the covering radius of codes , 1986, IEEE Trans. Inf. Theory.

[5]  Iiro S. Honkala,et al.  Modified bounds for coveting codes , 1991, IEEE Trans. Inf. Theory.

[6]  Zhen Zhang,et al.  Lower bounds on t[n, k] from linear inequalities , 1992, IEEE Trans. Inf. Theory.

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

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

[9]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[10]  Patric R. J. Östergård,et al.  A new binary code of length 10 and covering radius 1 , 1991, IEEE Trans. Inf. Theory.

[11]  M. Herzog,et al.  Linear and Nonlinear Single-Error-Correcting Perfect Mixed Codes , 1971, Inf. Control..

[12]  Patric R. J. Östergård,et al.  Upper bounds for q-ary covering codes , 1991, IEEE Trans. Inf. Theory.

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

[14]  N. J. A. Sloane,et al.  Inequalities for covering codes , 1988, IEEE Trans. Inf. Theory.

[15]  Tuvi Etzion.  New lower bounds for asymmetric and unidirectional codes , 1991, IEEE Trans. Inf. Theory.

[16]  Zhen Zhang,et al.  Linear inequalities for covering codes: Part II: Triple covering inequalities , 1992, IEEE Trans. Inf. Theory.

[17]  Olof Heden,et al.  A New Construction of Group and Nongroup Perfect Codes , 1977, Inf. Control..

[18]  Clement W. H. Lam,et al.  More Coverings by Rook Domains , 1984, J. Comb. Theory, Ser. A.

[19]  N. J. A. Sloane,et al.  On the covering radius of codes , 1985, IEEE Trans. Inf. Theory.

[20]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[21]  Eugene R. Rodemich.  Coverings by rook domains , 1970 .

[22]  Iiro S. Honkala,et al.  Bounds for binary multiple covering codes , 1993, Des. Codes Cryptogr..