Exponential sums and coding theory: A review (Q674552)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exponential sums and coding theory: A review |
scientific article; zbMATH DE number 986860
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential sums and coding theory: A review |
scientific article; zbMATH DE number 986860 |
Statements
Exponential sums and coding theory: A review (English)
0 references
29 July 1997
0 references
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.
0 references
application of exponential sums
0 references
Hecke operators
0 references
Kloosterman sums
0 references
survey
0 references
coding
0 references
sequence design
0 references
exponential sums
0 references
Weil-Carlitz-Uchiyama bound
0 references
Bombieri-Weil bound
0 references
Serre's bound
0 references
minimum distance
0 references
covering radius
0 references
Goppa code
0 references
BCH codes
0 references
weight distribution
0 references
linear codes
0 references
Kloosterman codes
0 references
Melas codes
0 references
Zetterberg codes
0 references
0.8273417949676514
0 references
