Exponential sums and coding theory: A review (Q674552)

The paper provides a survey of several recent applications of methods from analytic number theory to research in coding theory and sequence design. The presentation focusses on exponential sums and applications to coding theory of the Weil-Carlitz-Uchiyama bound, Bombieri-Weil bound, Serre's bound and others. Among the problems reviewed are results on the minimum distance and covering radius of Goppa and BCH codes. The weight distribution of many classes of linear codes are also studied, including the Kloosterman codes, Melas codes, and Zetterberg codes.