Skip to main content

On Linear Codes from Maximal Curves

  • Conference paper
Cryptography and Coding (IMACC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5921))

Included in the following conference series:

Abstract

Some linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cossidente, A., Korchmáros, G., Torres, F.: Curves of large genus covered by the Hermitian curve. Comm. Algebra 28, 4707–4728 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Feng, G.L., Rao, T.R.N.: A simple approach for construction of algebraic-geometric codes from affine plane curves. IEEE Trans. Inform. Theory 40, 1003–1012 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Feng, G.L., Rao, T.R.N.: Improved geometric Goppa codes, Part I: Basic theory. IEEE Trans. Inform. Theory 41, 1678–1693 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fuhrmann, R., Garcia, A., Torres, F.: On maximal curves. J. Number Theory 67, 29–51 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Garcia, A., Stichtenoth, H., Xing, C.P.: On subfields of the Hermitian function field. Compositio Math. 120, 137–170 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Garcia, A., Viana, P.: Weierstrass points on certain non-classic curves. Arch. Math. 46, 315–322 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Giulietti, M., Hirschfeld, J.W.P., Korchmáros, G., Torres, F.: A family of curves covered by the Hermitian curve. Sémin. Congr., Soc. Math. France 21, 63–78 (2009)

    Google Scholar 

  8. Giulietti, M., Hirschfeld, J.W.P., Korchmáros, G., Torres, F.: Curves covered by the Hermitian curve. Finite Fields Appl. 12, 539–564 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Garcia, A., Kim, S.J., Lax, R.F.: Consecutive Weierstrass gaps and minimum distance of Goppa codes. J. Pure Appl. Algebra 84, 199–207 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  10. Goppa, V.D.: Codes associated with divisors. Problemi Peredachi Informatsii 13, 33–39 (1977)

    MATH  MathSciNet  Google Scholar 

  11. Hirschfeld, J.W.P., Korchmáros, G., Torres, F.: Algebraic Curves over a Finite Field. Princeton University Press, Princeton (2008)

    MATH  Google Scholar 

  12. Høholdt, T., van Lint, J.H., Pellikaan, R.: Algebraic Geometry codes. In: Pless, V.S., Huffman, W.C., Brualdi, R.A. (eds.) Handbook of Coding Theory, vol. 1, pp. 871–961. Elsevier, Amsterdam (1998)

    Google Scholar 

  13. MinT. Tables of optimal parameters for linear codes, University of Salzburg, http://mint.sbg.ac.at/

  14. Tsfasman, M.A., Vladut, S.G.: Algebraic-goemetric codes. Kluwer, Amsterdam (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fanali, S. (2009). On Linear Codes from Maximal Curves. In: Parker, M.G. (eds) Cryptography and Coding. IMACC 2009. Lecture Notes in Computer Science, vol 5921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10868-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10868-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10867-9

  • Online ISBN: 978-3-642-10868-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics