Algebraic geometry codes and some applications
arXiv:2009.01281
Abstract
This article surveys the development of the theory of algebraic geometry codes since their discovery in the late 70's. We summarize the major results on various problems such as: asymptotic parameters, improved estimates on the minimum distance, and decoding algorithms. In addition, we present various modern applications of these codes such as public-key cryptography, algebraic complexity theory, multiparty computation or distributed storage.
Survey chapter to appear in "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and P. Sole' Eds., CRC Press
References in corpus (10)
- A family of optimal locally recoverable codes
- Squares of Random Linear Codes
- Explicit modular towers
- The dual minimum distance of arbitrary dimensional algebraic--geometric codes
- Locally recoverable codes from algebraic curves and surfaces
- On squares of cyclic codes
- An upper bound of Singleton type for componentwise products of linear codes
- Feng-Rao decoding of primary codes
- Torsion Limits and Riemann-Roch Systems for Function Fields and Applications
- Still better nonlinear codes from modular curves