  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.
