Exponential sums and coding theory: A review

DOI10.1023/A:1005794417363zbMATH Open0884.11054OpenAlexW137366342MaRDI QIDQ674552FDOQ674552

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

Recommendations

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

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)

Cited In (12)

• On Weil's proof of the bound for Kloosterman sums.
• Exponential sums, Gauss sums and cyclic codes
• Classical simulation of quantum circuits by half Gauss sums
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniform asymptotics of some Abel sums arising in coding theory
• Traces of Hecke operators and refined weight enumerators of Reed-Solomon codes
• Iterated logarithmic expansions of the pathwise code lengths for exponential families

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)