Linear codes and modular curves

Results of recent investigations at the juncture of coding theory, the theory of computability, and algebraic geometry over finite fields are presented. The basic problems of the asymptotic theory of codes and Goppa's construction of codes on the basis of algebraic curves are presented, and a detailed algorithmic analysis is given of the codes arising on the modular curves of elliptic modules of V. G. Drinfel'd.