Exponential sums and coding theory: A review

DOI10.1023/A:1005794417363MaRDI QIDQ674552zbMATHOpenAlexFDO

Authors 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 sumsminimum distanceweight distributionBCH codesHecke operatorsKloosterman sumslinear codescovering radiuscodingGoppa 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) Cyclic codes (94B15) Combinatorial codes (94B25) Exponential sums (11T23) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Exponential Sums and Goppa Codes: I
• scientific article; zbMATH DE number 953231
• scientific article; zbMATH DE number 1284426

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)