On character sums and codes (Q1075358): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear programming bounds for tree codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3936653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on the asymptotic behavior of the information rate of block codes (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5521595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MacWilliams Identities for Nonlinear Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations over finite fields. An elementary approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Maximum Moduli of Certain Character Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3318856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5794285 / rank
 
Normal rank

Latest revision as of 14:12, 17 June 2024

scientific article
Language Label Description Also known as
English
On character sums and codes
scientific article

    Statements

    On character sums and codes (English)
    0 references
    0 references
    1985
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    lower bounds for character sums
    0 references
    Coding-theoretical methods
    0 references
    multiplicative character
    0 references
    finite field
    0 references