An extension theorem for arcs and linear codes

AbstractWe prove the following generalization to the extension theorem of Hill and Lizak: For every nonextendable linear [n, k, d]q code, q = ps, (d,q) = 1, we have $$\sum\limits_{i\not \equiv 0,d(\bmod q)} {A_i > q^{k - 3} r(q),} $$ where q + r(q) + 1 is the smallest size of a nontrivial blocking set in PG(2, q). This result is applied further to rule out the existence of some linear codes over $$\mathbb{F}_4 $$ meeting the Griesmer bound.

[1]  Werner Heise,et al.  Informations- und Codierungstheorie - mathematische Grundlagen der Daten-Kompression und -Sicherung in diskreten Kommunikationssystemen (3. Aufl.) , 1983 .

[2]  R. Hill,et al.  Extensions of linear codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

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

[4]  Tatsuya Maruta,et al.  On the minimum length of quaternary linear codes of dimension five , 1999, Discret. Math..

[5]  R. C. Bose,et al.  A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes , 1966 .

[6]  On the Extendability of Linear Codes , 2001 .

[7]  Harold N. Ward.  Divisibility of Codes Meeting the Griesmer Bound , 1998, J. Comb. Theory, Ser. A.

[8]  Ray Hill,et al.  An Extension Theorem for Linear Codes , 1999, Des. Codes Cryptogr..

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

[10]  Ivan N. Landjev.  Linear codes over finite fields and finite projective geometries , 2000, Discret. Math..

[11]  Stefan M. Dodunekov,et al.  Codes and Projective Multisets , 1998, Electron. J. Comb..

[12]  I. Landjev.  The Geometric Approach to Linear Codes , 2001 .

[13]  Ray Hill,et al.  On (q2 + q + 2, q + 2)-arcs in the Projective Plane PG(2, q) , 2001, Des. Codes Cryptogr..

[14]  Werner Heise,et al.  Informations- und Codierungstheorie , 1983 .

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

[16]  R. Mathon,et al.  Combinatorial and computational aspects of finite geometries , 2000 .

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

[18]  Ray Hill,et al.  A First Course in Coding Theory , 1988 .

[19]  A. Beutelspacher.  Blocking sets and partial spreads in finite projective spaces , 1980 .

[20]  Harold N. Ward.  A Sequence of Unique Quaternary Griesmer Codes , 2004, Des. Codes Cryptogr..

[21]  Thomas Honold,et al.  Linear Codes over Finite Chain Rings , 1999, Electron. J. Comb..