On character sums and codes

DOI10.1016/0012-365X(85)90180-3MaRDI QIDQ1075358zbMATH OpenOpenAlexFDO

Authors 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

Coding-theoretical methodsfinite fieldlower bounds for character sumsmultiplicative character

Mathematics Subject Classification ID

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

Review text

Coding-theoretical methods are used to obtain improved lower bounds for the function \(S(d,r,q)=\max | \sum_{\alpha \in F}\chi (f(\alpha))|\) where \(\chi\) is a multiplicative character of order d over a finite field F of q elements and the maximum is taken over all polynomials f(x)\(\in F[x]\) which are not d-th powers and have exactly r distinct zeros in the splitting field.

Recommendations

• scientific article; zbMATH DE number 3849345
• Some estimates for character sums and applications
• scientific article; zbMATH DE number 3849344
• scientific article; zbMATH DE number 1594313
• scientific article; zbMATH DE number 953231

Cites work

• Equations over finite fields. An elementary approach
• scientific article; zbMATH DE number 3849344 (Why is no real title available?)
• scientific article; zbMATH DE number 3752758 (Why is no real title available?)
• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• scientific article; zbMATH DE number 3499621 (Why is no real title available?)
• scientific article; zbMATH DE number 3633251 (Why is no real title available?)
• scientific article; zbMATH DE number 3233758 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• scientific article; zbMATH DE number 3055095 (Why is no real title available?)
• Linear programming bounds for tree codes (Corresp.)
• Lower Bounds for the Maximum Moduli of Certain Character Sums
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
• The MacWilliams Identities for Nonlinear Codes

Cited in

(8)

• On the cardinality of sets of sequences with given maximum correlation
• Character sum constructions of constrained error-correcting codes
• scientific article; zbMATH DE number 3849344 (Why is no real title available?)
• scientific article; zbMATH DE number 3849345 (Why is no real title available?)
• An Asymptotic Lower Bound for the Character Sums induced by the Legendre Symbol
• scientific article; zbMATH DE number 4112530 (Why is no real title available?)
• On zero-testing and interpolation of sums of characters
• Exact values of the sums of multiplicative characters of polynomials over finite fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075358)