Skip to main content
SpringerLink
Log in

Minimum distance of Hermitian two-point codes

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

Abstract

We prove a formula for the minimum distance of two-point codes on a Hermitian curve.

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. Beelen P. (2007) The order bound for general algebraic geometric codes. Finite Fields Appl. 13(3): 665–680

    Article  MATH  MathSciNet  Google Scholar 

  2. Carvalho C., Munuera C., Silva E., Torres F. (2007) Near orders and codes. IEEE Trans. Inform. Theory 53(5): 1919–1924

    Article  MathSciNet  Google Scholar 

  3. Duursma I.M. (1993) Majority coset decoding. IEEE Trans. Inform. Theory 39(3): 1067–1070

    Article  MATH  MathSciNet  Google Scholar 

  4. Feng G.L., Rao T.R.N. (1993) Decoding algebraic-geometric codes up to the designed minimum distance. IEEE Trans. Inform. Theory 39(1): 37–45

    Article  MATH  MathSciNet  Google Scholar 

  5. Hirschfeld J.W.P. (1998) Projective geometries over finite fields. second edn. The Clarendon Press Oxford University Press, Oxford mathematical monographs

    Google Scholar 

  6. Homma M., Kim S.J. (2005) Toward the determination of the minimum distance of two-point codes on a Hermitian curve. Des. Codes Cryptogr. 37(1): 111–132

    Article  MATH  MathSciNet  Google Scholar 

  7. Homma M., Kim S.J. (2006) The complete determination of the minimum distance of two-point codes on a Hermitian curve. Des. Codes Cryptogr. 40(1): 5–24

    Article  MATH  MathSciNet  Google Scholar 

  8. Homma M., Kim S.J. (2006) The two-point codes on a Hermitian curve with the designed minimum distance. Des. Codes Cryptogr. 38(1): 55–81

    Article  MATH  MathSciNet  Google Scholar 

  9. Homma M., Kim S.J. (2006) The two-point codes with the designed distance on a Hermitian curve in even characteristic. Des. Codes Cryptogr. 39(3): 375–386

    Article  MATH  MathSciNet  Google Scholar 

  10. Kirfel C., Pellikaan R.: The minimum distance of codes in an array coming from telescopic semigroups. IEEE Trans. Inform. Theory. 41(6, part 1):1720–1732, (1995). (Special issue on algebraic geometry codes).

    Google Scholar 

  11. Pellikaan R.: The shift bound for cyclic, Reed–Muller and geometric Goppa codes. In: Arithmetic, geometry and coding theory (Luminy, 1993), pp. 155–174. de Gruyter, Berlin (1996).

  12. van Lint J.H., Wilson R.M. (1986) On the minimum distance of cyclic codes. IEEE Trans. Inform. Theory. 32(1): 23–40

    Article  MATH  MathSciNet  Google Scholar 

  13. Yang K., Kumar P.V.: On the true minimum distance of Hermitian codes. In: Coding theory and algebraic geometry (Luminy, 1991). Lecture Notes in Math., vol. 1518, pp. 99–107. Springer, Berlin (1992).

Download references

Author information

Authors and Affiliations

  1. School of Computational Sciences, Korea Institute for Advanced Study, Seoul, Korea

    Seungkook Park

Authors
  1. Seungkook Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seungkook Park.

Additional information

Communicated by Gabor Korchmaros.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Park, S. Minimum distance of Hermitian two-point codes. Des. Codes Cryptogr. 57, 195–213 (2010). https://doi.org/10.1007/s10623-009-9361-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-009-9361-4

Keywords

Mathematics Subject Classification (2000)

Search

Navigation