Quasi-Perfect Linear Codes With Minimum Distance $4$

Some new infinite families of short quasi-perfect linear codes are described. Such codes provide improvements on the currently known upper bounds on the minimal length of a quasi-perfect [n,n-m,4]q-code when either 1) q=16, m ges 5, m odd, or 2) q=2i, 7 les i les 15, m ges 4, or 3) q=22lscr , lscr ges 8, m ges 5, m odd. As quasi-perfect [n,n-m,4]q-codes and complete n-caps in projective spaces PG(m-1,q) are equivalent objects, new upper bounds on the size of the smallest complete cap in PG(m-1,q) are obtained

[1]  Charles C. Lindner,et al.  Steiner Quadruple Systems , 2008 .

[2]  Fernanda Pambianco,et al.  Small Complete Caps in Spaces of Even Characteristic , 1996, J. Comb. Theory, Ser. A.

[3]  Gérard D. Cohen,et al.  Linear Codes with Covering Radius and Codimension , 2001 .

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

[5]  J. Hirschfeld,et al.  The packing problem in statistics, coding theory and finite projective spaces , 1998 .

[6]  J. Hirschfeld,et al.  The packing problem in statistics, coding theory and finite projective spaces : update 2001 , 2001 .

[7]  Kevin T. Phelps,et al.  On Perfect Codes: Rank and Kernel , 2002, Des. Codes Cryptogr..

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

[9]  Patric R. J. Östergård,et al.  On Saturating Sets in Small Projective Geometries , 2000, Eur. J. Comb..

[10]  Stefano Marcugini,et al.  Complete caps in projective spaces PG (n, q) , 2004 .

[11]  Alexander Vardy,et al.  Perfect binary codes: constructions, properties, and enumeration , 1994, IEEE Trans. Inf. Theory.

[12]  Behruz Tayfeh-Rezaie,et al.  A Hadamard matrix of order 428 , 2005 .

[13]  David L. Wehlau,et al.  A family of small complete caps in PG(n, 2) , 2003, Eur. J. Comb..

[14]  Tuvi Etzion,et al.  Quasi-perfect codes with small distance , 2005, IEEE Transactions on Information Theory.

[15]  Stefano Marcugini,et al.  Computer search in projective planes for the sizes of complete arcs , 2005 .

[16]  Gérard D. Cohen,et al.  Covering radius - Survey and recent results , 1985, IEEE Trans. Inf. Theory.

[17]  Massimo Giulietti,et al.  Small complete caps in PG(N, q), q even , 2007 .

[18]  B. Segre.  On complete caps and ovaloids in three-dimensional Galois spaces of characteristic two , 1959 .

[19]  Stefano Marcugini,et al.  On saturating sets in projective spaces , 2003, J. Comb. Theory, Ser. A.

[20]  Stefano Marcugini,et al.  The smallest size of a complete cap in PG(3, 7) , 2006, Discret. Math..

[21]  A. A. Davydov,et al.  A computer search for small complete caps , 1998 .

[22]  Massimo Giulietti,et al.  Small complete caps in Galois affine spaces , 2007 .

[23]  Patric R. J. Östergård,et al.  New Quaternary Linear Codes with Covering Radius 2 , 2000 .

[24]  Kevin T. Phelps,et al.  Rank and kernel of binary Hadamard codes , 2005, IEEE Transactions on Information Theory.

[25]  Patric R. J. Österg»rd.  Computer search for small complete caps , 2000 .

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

[27]  P. Östergård,et al.  Recursive constructions of complete caps , 2001 .

[28]  Alexander A. Davydov,et al.  Constructions and families of nonbinary linear codes with covering radius 2 , 1999, IEEE Trans. Inf. Theory.

[29]  Patric R. J. Östergård,et al.  Linear codes with covering radius R = 2, 3 and codimension tR , 2001, IEEE Trans. Inf. Theory.

[30]  Patric R. J. Osterg Aa Rd.  Computer search for small complete caps , 2000 .

[31]  Stefano Marcugini,et al.  Linear codes with covering radius 2, 3 and saturating sets in projective geometry , 2004, IEEE Transactions on Information Theory.

[32]  Bernhard Ganter,et al.  Algebraic techniques for nonlinear codes , 1983, Comb..

[33]  Patric R. J. Östergård,et al.  New Linear Codes with Covering Radius 2 and Odd Basis , 1999, Des. Codes Cryptogr..

[34]  Alexander A. Davydov,et al.  Constructions and families of covering codes and saturated sets of points in projective geometry , 1995, IEEE Trans. Inf. Theory.

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

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

[37]  Rita Procesi,et al.  Codes and groups , 2006 .

[38]  Mario Gionfriddo,et al.  Construction of Steiner quadruple systems having a prescribed number of blocks in common , 1981, Discret. Math..

[39]  Kevin T. Phelps,et al.  Hadamard Codes of Length 2ts (s Odd). Rank and Kernel , 2006, AAECC.

[40]  Stefano Marcugini,et al.  Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces , 2005, IEEE Transactions on Information Theory.

[41]  T. Etzion,et al.  On perfect codes and tilings: problems and solutions , 1997, Proceedings of IEEE International Symposium on Information Theory.

[42]  J. Hirschfeld.  Projective Geometries Over Finite Fields , 1980 .