Abstract
In this paper, we prove the nonexistence of Griesmer codes over the field of five elements for k = 4 and d = 33, 83, 163, 164.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Boukliev, S. Kapralov, T. Maruta and M. Fukui, Optimal linear codes of dimension 4 over <math>F5</math>, IEEE Trans. Inform. Theory, Vol. 43 (1997) pp. 308–313.
S. Dodunekov and J. Simonis, Codes and projective multisets, Electronic Journal of Combinatorics, Vol. 5, No. #R37 (1998).
S. Ferret and L. Storme, Minihypers and linear codes meeting the Griesmer bound: Improvements to results of Hamada, Helleseth and Maekawa, Designs, Codes and Cryptography, to appear.
J. H. Griesmer, A bound for error-correcting codes, IBM J. Res. Develop., Vol. 4 (1960) pp. 532–542.
N. Hamada and M. Deza, A characterization of {νµ+1+ ɛ, νµ; t, q}-minihypers and its application to errorcorrecting codes and factorial design, J. Statist. Plann. Inference, Vol. 22 (1989) pp. 323–336.
N. Hamada and T. Helleseth, A characterization of some q-ary codes (q > (h − 1)2, h ≤ 3) meeting the Griesmer bound, Math. Japonica, Vol. 38 (1993) pp. 925–940.
N. Hamada and T. Maekawa, A characterization of some q-ary codes (q > (h − 1)2, h ≤ 3) meeting the Griesmer bound, Part 2, Math. Japonica, Vol. 46 (1997) pp. 241–252.
R. Hill and P. Lizak, Extensions of linear codes, In Proc. Int. Symp. on Inf. Theory, Whistler, Canada (1995) p. 345.
J. W. P. Hirschfeld, Projective Geometries over Finite Fields, 2nd ed., Oxford University Press (1998).
J. W. P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces, In (A. Blokhuis et al., eds.), Finite Geometries, Proc. of the Fourth Isle of Thorns Conference, Kluwer (2001) pp. 201–246.
I. Landjev, Optimal linear codes of dimension 4 over <math>F5</math>, Lecture Notes in Comp. Science, Vol. 1255 (1997) pp. 212–220.
I. Landjev, Linear codes over finite fields and finite projective geometries, Discrete Mathematics, Vol. 213 (2000) pp. 211–244.
I. Landjev, The geometric approach to linear codes, In (A. Blokhuis et al., eds.), Finite geometries, Proc. of the Fourth Isle of Thorns Conference, Kluwer (2001) pp. 247–257.
I. Landjev and T. Honold, Arcs in projective Hjelmslev planes, Discrete Mathematics and Applications, Vol. 11 (2001) pp. 53–70.
I. Landjev and A Rousseva, Optimal linear codes over <math>F5</math> Proc. of the 7th Int. Workshop on ACCT, Bansko (2000) pp. 207–212.
L. Lunelli and M. Sce, Considerazioni arithmetiche e resultati, sperimentali sui {K, n} q archi, Ist. Lombardo Accad. Sci. Rend., Vol. A98 (1964) pp. 3–52.
T. Maruta, On the minimum length of q-ary linear codes of dimension four, Discrete Math., Vol. 208/209 (1999) pp. 427–435.
T. Maruta, A new extension theorem for linear codes, in preparation.
T. Maruta and R. Hill, The nonexistence of [206, 4, 164]5 codes, In Proc. EuroWorkshop on Optimal Codes, Sunny Beach (2001) pp. 111–116.
T. Maruta, I. Landjev and A. Rousseva, On the minimum size of some minihypers and related linear codes, manuscript.
H. N. Ward, The nonexistence of a [207, 4, 165] code over GF(5), Designs, Codes and Cryptography, Vol. 22 (2001) pp. 139–148.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Landjev, I., Rousseva, A., Maruta, T. et al. On Optimal Codes Over the Field with Five Elements. Designs, Codes and Cryptography 29, 165–175 (2003). https://doi.org/10.1023/A:1024108609872
Issue Date:
DOI: https://doi.org/10.1023/A:1024108609872