Skip to main content
SpringerLink
Log in

Maximal AMDS codes

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Complete (n, k)-arcs in PG(k − 1, q) and projective (n, k) q -AMDS codes that admit no projective extensions are equivalent objects. We show that projective AMDS codes of reasonable length admit only linear extensions. Thus, we are able to prove the maximality of many known linear AMDS codes. At the same time our results sharply limit the possibilities for constructing long nonlinear AMDS codes. We also show that certain short linear AMDS codes are maximal. Central to our approach is the Bruen–Silverman model of linear codes first introduced in Alderson (On MDS codes and Bruen–Silverman codes. Ph.D. Thesis, University of Western Ontario, 2002) and Alderson et al. (J. Combin. Theory Ser. A 114(6), 1101–1117, 2007).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alderson, T., Bruen, A.A., Silverman, R.: Maximum distance separable codes and arcs in projective spaces. J. Combin. Theory Ser. A 114(6), 1101–1117 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alderson, T.L.: On MDS codes and Bruen-Silverman codes. Ph.D. Thesis, University of Western Ontario (2002)

  3. Ball, S.: Multiple blocking sets and arcs in finite planes. J. Lond. Math. Soc. (2) 54(3), 581–593 (1996)

    MATH  Google Scholar 

  4. Ball, S.: The number of directions determined by a function over a finite field. J. Combin. Theory Ser. A 104(2), 341–350 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ball, S., Hirschfeld, J.W.P.: Bounds on (n, r)-arcs and their application to linear codes. Finite Fields Appl. 11(3), 326–336 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Barlotti, A.: Sui {k; n}-archi di un piano lineare finito. Boll. Un. Mat. Ital. (3) 11, 553–556 (1956)

    MATH  MathSciNet  Google Scholar 

  7. Barnabei, M., Searby, D., Zucchini, C.: On small {k; q}-arcs in planes of order q 2. J. Comb. Theory Ser. A 24(2), 241–246 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bierbrauer, J.: The maximal size of a 3-arc in PG(2,8). J. Comb. Math. Comb. Comput. 45, 145–161 (2003)

    MATH  MathSciNet  Google Scholar 

  9. Blokhuis, A., Ball, S., Brouwer, A.E., Storme, L., Szőnyi, T.: On the number of slopes of the graph of a function defined on a finite field. J. Comb. Theory Ser. A 86(1), 187–196 (1999)

    Article  MATH  Google Scholar 

  10. Boer, M.A. de: Almost MDS codes. Des. Codes Cryptogr. 9(2), 143–155 (1996)

    MATH  MathSciNet  Google Scholar 

  11. Bramwell, D.: Ph.D. Thesis, University of London (1973)

  12. Braun, M., Kohnert, A., Wassermann, A.: Construction of (n,r)-arcs in PG(2, q). Innov. Incidence Geom. 1, 133–141 (2005)

    MATH  MathSciNet  Google Scholar 

  13. Bruen, A.A., Silverman, R.: On extendable planes, M.D.S. codes and hyperovals in PG(2, q), q = 2t. Geom. Dedicata 28(1), 31–43 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  14. Bruen, A.A., Thas, J.A., Blokhuis, A.: On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre. Invent. Math. 92(3), 441–459 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  15. Casse, L.R.A.: A solution to Beniamino Segre’s “Problem I r,q ” for q even. Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8) 46, 13–20 (1969)

    MATH  MathSciNet  Google Scholar 

  16. Dodunekov, S., Landgev, I.: On near MDS codes. J. Geom. 54(1–2), 30–43 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Dodunekov, S.M., Landjev, I.N.: Near-MDS codes over some small fields. Discrete Math. 213(1–3), 55–65 (2000). Selected topics in discrete mathematics (Warsaw, 1996)

    Google Scholar 

  18. Giulietti, M.: On the extendibility of near-MDS elliptic codes. Appl. Algebra Eng. Comm. Comput. 15(1), 1–11 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  19. Hirschfeld, J.W.P.: Complete arcs. Discrete Math. 174(1–3), 177–184 (1997). Combinatorics (Rome and Montesilvano, 1994)

    Google Scholar 

  20. Hirschfeld, J.W.P.: Projective geometries over finite fields, 2nd edn. Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, New York (1998)

    Google Scholar 

  21. Hirschfeld, J.W.P., Sadeh, A.R.: The projective plane over the field of eleven elements. Mitt. Math. Sem. Giessen 164, 245–257 (1984)

    MathSciNet  Google Scholar 

  22. Hirschfeld, J.W.P., Voloch, J.F.: The characterization of elliptic curves over finite fields. J. Aust. Math. Soc. Ser. A 45(2), 275–286 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  23. Lunelli, L., Sce, M.: Considerazioni arithmetiche e risultati sperimentali sui {K; n} q -archi. Ist. Lombardo Accad. Sci. Lett. Rend. A 98, 3–52 (1964)

    MATH  MathSciNet  Google Scholar 

  24. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, vol. 16. II. North-Holland Mathematical Library. North-Holland Publishing Co, Amsterdam (1977)

    Google Scholar 

  25. Marcugini, S., Milani, A., Pambianco, F.: Maximal (n, 3)-arcs in PG(2, 11). Discrete Math. 208/209, 421–426 (1999). Combinatorics (Assisi, 1996)

  26. Marcugini, S., Milani, A., Pambianco, F.: Maximal (n, 3)-arcs in PG(2, 13). Discrete Math. 294(1–2), 139–145 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  27. Rédei, L.: Lacunary polynomials over finite fields. North-Holland Publishing Co., Amsterdam (1973). Translated from the German by I. Földes

  28. Segre, B.: Curve razionali normali e k-archi negli spazi finiti. Ann. Mat. Pura Appl. (4) 39, 357–379 (1955)

    Article  MATH  MathSciNet  Google Scholar 

  29. Silverman, R.: A metrization for power-sets with applications to combinatorial analysis. Canad. J. Math. 12, 158–176 (1960)

    MATH  MathSciNet  Google Scholar 

  30. Thas, J.A.: Normal rational curves and k-arcs in Galois spaces. Rend. Mat. (6) 1, 331–334 (1968)

    MATH  MathSciNet  Google Scholar 

  31. Thas, J.A.: Finite geometries, varieties and codes. In: Proceedings of the International Congress of Mathematicians, vol. III (Berlin, 1998), Extra vol. III, pp. 397–408 (electronic) (1998)

  32. Waterhouse, W.C.: Abelian varieties over finite fields. Ann. Sci. École Norm. Sup. (4) 2, 521–560 (1969)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Sciences, University of New Brunswick, Saint John, NB, E2L 4L5, Canada

    T. L. Alderson

  2. Electrical Engineering, University of Calgary, Calgary, NB, T2N 1N4, Canada

    A. A. Bruen

Authors
  1. T. L. Alderson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Bruen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to T. L. Alderson.

Additional information

The authors acknowledge support from the N.S.E.R.C. of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alderson, T.L., Bruen, A.A. Maximal AMDS codes. AAECC 19, 87–98 (2008). https://doi.org/10.1007/s00200-008-0058-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-008-0058-0

Keywords

Search

Navigation