Exponential sums and coding theory: A review

DOI10.1023/A:1005794417363zbMath0884.11054OpenAlexW137366342MaRDI QIDQ674552

Norman E. Hurt

Publication date: 29 July 1997

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1005794417363

zbMATH Keywords

surveyexponential sumsBCH codescovering radiuslinear codesweight distributionKloosterman sumscodingHecke operatorsminimum distanceGoppa codeMelas codessequence designapplication of exponential sumsBombieri-Weil boundKloosterman codesSerre's boundWeil-Carlitz-Uchiyama boundZetterberg codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Exponential sums (11T23) Cyclic codes (94B15) Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (7)

Estimations on some hybrid exponential sums related to Kloosterman sums ⋮ A transform property of Kloosterman sums ⋮ A note on the distinctness of some Kloosterman sums ⋮ Counting plane cubic curves over finite fields with a prescribed number of rational intersection points ⋮ Traces of Hecke operators and refined weight enumerators of Reed-Solomon codes ⋮ Classical simulation of quantum circuits by half Gauss sums ⋮ On Weil's proof of the bound for Kloosterman sums.

This page was built for publication: Exponential sums and coding theory: A review