On character sums and codes

DOI10.1016/0012-365X(85)90180-3zbMath0592.10032OpenAlexW2088386278MaRDI QIDQ1075358

Hannu Tarnanen

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90180-3

zbMATH Keywords

finite fieldmultiplicative characterlower bounds for character sumsCoding-theoretical methods

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Estimates on character sums (11L40) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (2)

Exact values of the sums of multiplicative characters of polynomials over finite fields ⋮ On the cardinality of sets of sequences with given maximum correlation

Cites Work

• Equations over finite fields. An elementary approach
• Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
• Lower Bounds for the Maximum Moduli of Certain Character Sums
• The MacWilliams Identities for Nonlinear Codes
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Linear programming bounds for tree codes (Corresp.)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On character sums and codes