Algebraic geometry codes and some applications
It provides a comprehensive overview for researchers in coding theory and related fields, but is incremental as it is a survey paper.
This paper surveys the development of algebraic geometry codes since their discovery in the late 1970s, summarizing major results on problems like asymptotic parameters, minimum distance estimates, and decoding algorithms, and presents modern applications in areas such as public-key cryptography and distributed storage.
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.