Skip to main content
SpringerLink
Log in

Generalized AG Codes as Evaluation Codes

  • Conference paper
Algebraic Informatics (CAI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8080))

Included in the following conference series:

  • 831 Accesses

Abstract

We extend the construction of GAG codes to the case of evaluation codes. We estimate the minimum distance of these extended evaluation codes and we describe the connection to the one-point GAG codes.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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. Niederreiter, H., Xing, C., Lam, K.Y.: New construction of algebraic-geometry codes. Appl. Algebra Engrg. Comm. Comput. 9(5), 373–381 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Xing, C., Niederreiter, H., Lam, K.Y.: A generalization of algebraic-geometry codes. IEEE Transactions on Information Theory 45(7), 2498–2501 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Goppa, V.D.: Codes on algebraic curves. Dokl. Akad. NAUK, SSSR 259, 1289–1290 (1981)

    MathSciNet  Google Scholar 

  4. Goppa, V.D.: Algebraico-geometric Codes. Izv. Akad. NAUK, SSSR 46, 75–91 (1982)

    MathSciNet  Google Scholar 

  5. Özbudak, F., Stichtenoth, H.: Constructing codes from algebraic curves. IEEE Transactions on Information Theory 45(7), 2502–2505 (1999)

    Article  MATH  Google Scholar 

  6. Heydtmann, A.E.: Generalized geometric Goppa codes. Comm. Algebra 30(6), 2763–2789 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ding, C., Niederreiter, H., Xing, C.: Some new codes from algebraic curves. IEEE Transactions on Information Theory 46(7), 2638–2642 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Calderini, M., Faina, G.: Generalized Algebraic Geometric Codes From Maximal Curves. IEEE Transactions on Information Theory 58(4), 2386–2396 (2012)

    Article  MathSciNet  Google Scholar 

  9. Xing, C., Yeo, S.L.: New linear codes and algebraic function fields over finite fields. IEEE Transactions on Information Theory 53(12), 4822–4825 (2007)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  11. Fitzgerald, J., Lax, R.F.: Decoding affine variety codes using Göbner bases. Des. Codes Cryptogr. 13(2), 147–158 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Orsini, E., Marcolla, C., Sala, M.: Improved decoding of affine-variety codes. Journal of Pure and Applied Algebra 216(7), 1533–1565 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Geil, O.: Evaluation codes from an affine variety code perspective. In: Advances in Algebraic Geometry Codes. Series on Coding Theory and Cryptology, vol. 5, pp. 153–180. World Sci. Publ., Hackensack (2008)

    Chapter  Google Scholar 

  14. Geil, O., Pellikaan, R.: On the Structure of Order Domains. Finite Fields and their Applications 8, 369–396 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Geil, O.: Algebraic Geometry Codes from Order Domains. In: Sala, Mora, Perret, Sakata, Traverso (eds.) Gröbner Bases. Coding, and Cryptography, pp. 121–141. Springer (2009)

    Google Scholar 

  16. Matsumoto, R.: Miuras Generalization of One-Point AG codes is Equivalent to Høholdt, van Lint and Pellikaan’s Generalization. IEICE Trans. Fundamentals E82-A(10), 2007–2010 (1999)

    Google Scholar 

  17. Andersen, H.E., Geil, O.: Evaluation codes from order domain theory. Finite Fields and Their Applications 14, 92–123 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Trento, Italy

    Marco Calderini & Massimiliano Sala

Authors
  1. Marco Calderini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Massimiliano Sala
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ERISCS Research Group, Parc Scientifique de, Aix-Marseille University, Luminy, 13288, Marseille CEDEX 9, France

    Traian Muntean

  2. Department of Mathematics, Aristotle University of Thessaloniki, University Campus, 54124, Thessaloniki, Greece

    Dimitrios Poulakis

  3. ERISCS Research Group and IML Research Laboratory, Parc Scientifique de, Aix-Marseille University, Luminy, 13288, Marseille, France

    Robert Rolland

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calderini, M., Sala, M. (2013). Generalized AG Codes as Evaluation Codes. In: Muntean, T., Poulakis, D., Rolland, R. (eds) Algebraic Informatics. CAI 2013. Lecture Notes in Computer Science, vol 8080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40663-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40663-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40662-1

  • Online ISBN: 978-3-642-40663-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation