Exponential sums and coding theory: A review
From MaRDI portal
Recommendations
Cited in
(12)- A note on the distinctness of some Kloosterman sums
- On Weil's proof of the bound for Kloosterman sums.
- Uniform asymptotics of some Abel sums arising in coding theory
- Iterated logarithmic expansions of the pathwise code lengths for exponential families
- scientific article; zbMATH DE number 1594307 (Why is no real title available?)
- Classical simulation of quantum circuits by half Gauss sums
- Estimations on some hybrid exponential sums related to Kloosterman sums
- Traces of Hecke operators and refined weight enumerators of Reed-Solomon codes
- A transform property of Kloosterman sums
- scientific article; zbMATH DE number 1996491 (Why is no real title available?)
- Exponential sums, Gauss sums and cyclic codes
- Counting plane cubic curves over finite fields with a prescribed number of rational intersection points
This page was built for publication: Exponential sums and coding theory: A review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674552)