Skip to main content
SpringerLink
Log in

Almost MDS Codes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

MDS codes are codes meeting the Singleton bound. Both for theory and practice, these codes are very important and have been studied extensively. Codes near this bound, but not attaining it, have had far less attention. In this paper we study codes that almost reach the Singleton bound.

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. S. M. Ball, On sets of points in finite planes, Ph.D. Thesis, University of Sussex, U.K. (1994).

    Google Scholar 

  2. R. C. Bose and K. A. Bush, Orthogonal arrays of strength two and three, Ann.Math.Stat, Vol. 23 (1952) pp. 508–524.

    Google Scholar 

  3. A. E. Brouwer, private communication.

  4. K. A. Bush, Orthogonal arrays of index unity, Ann.Math.Stat., Vol. 23 (1952) pp. 426–434.

    Google Scholar 

  5. J. M. Chao and H. Kaneta, Rational arcs in PG.r; q/ for 11 q· 19, preprint.

  6. S. M. Dodunekov and I. N. Landgev, On Near MDS Codes, Report LiTH-ISY-R-1563, Department of Electrical Engineering Link¨ oping University, Sweden, 1994–02–02.

    Google Scholar 

  7. S. M. Dodunekov and I. N. Landgev, On near-MDS codes, to appear in J.of Geometry.

  8. B. R. Gulati, More about maximal. n; r /-sets, Information and Control, Vol. 20 (1972) pp. 188–191.

    Google Scholar 

  9. J. W. P. Hirschfeld, Projective Geometries over Finite Fields, Oxford University Press, Oxford (1979).

    Google Scholar 

  10. J. W. P. Hirschfeld and J. A. Thas, General Galois Geometries, Oxford University Press, Oxford (1991).

    Google Scholar 

  11. J. Justesen, K. J. Larsen, H. Jensen, A. Havemose and T. Høholdt, Construcion an decoding of a class of algebraic geometric codes, IEEE Trans.Inform.Theory, Vol. 35 (1989) pp. 811–821.

    Google Scholar 

  12. J. F. K. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977).

    Google Scholar 

  13. B. Qvist, Some remarks concerning curves of the second degree in a finite plane, Ann.Acad, Sci.Fen.Ser.A Vol. 134 (1952).

  14. R. C. Singleton, Maximum distance separable q-nary codes, IEEE Trans.Inform.Theory, Vol. 10 (1964) pp. 116–118.

    Google Scholar 

  15. J. Thas, Some results concerning. q C 1/.n ¡ 1/; n/-arcs, J.Combin.Theory A, Vol. 19 (1975) pp. 228–232.

    Google Scholar 

  16. M. A. Tsfasman and S. G. Vl¡ adu¸t, Algebraic-Geometric Codes, Kluwer Academic Publishers, Dor-drecht/ Boston/London (1991).

    Google Scholar 

  17. J. Q. Ying and T. Ikeda, Analysis of the Parameters of Codes from Hermitian Surface over GF(4), Technical report of IEICE, IT93–6 (1993) pp. 29–34.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600, MB Eindhoven, the, Netherlands

    Mario A. de Boer

Authors
  1. Mario A. de Boer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

de Boer, M.A. Almost MDS Codes. Designs, Codes and Cryptography 9, 143–155 (1996). https://doi.org/10.1023/A:1018014013461

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018014013461

Search

Navigation