Some estimates for character sums and applications

DOI10.1023/A:1008300619004zbMath0995.11067OpenAlexW1572767128MaRDI QIDQ5929715

Arne Winterhof

Publication date: 3 October 2002

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008300619004

zbMATH Keywords

finite fieldscharacter sumsdc-constrained codesdifference matricesdistribution of powers

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24)

Related Items (19)

Family complexity and cross-correlation measure for families of binary sequences ⋮ On pseudorandom binary sequences constructed by using finite fields ⋮ On multi-dimensional pseudorandom subsets ⋮ Generalized explicit inversive generators of small \(p\)-weight degree ⋮ On the distribution of points in orbits of \(\text{PGL}(2,q)\) acting on \(\text{GF}(q^{n})\). ⋮ Unnamed Item ⋮ On the elliptic curve endomorphism generator ⋮ Equations in finite fields with restricted solution sets. II: Algebraic equations ⋮ On finite pseudorandom binary lattices ⋮ A large family of Boolean functions ⋮ Construction of pseudorandom binary lattices based on multiplicative characters ⋮ On an inequality between pseudorandom measures of lattices ⋮ On finite pseudorandom lattices of \(k\) symbols ⋮ On pseudorandom sequences of \(k\) symbols constructed using finite fields ⋮ Construction of pseudorandom binary lattices using elliptic curves ⋮ Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields ⋮ Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). ⋮ Measures of pseudorandomness for binary sequences constructed using finite fields ⋮ More constructions of pseudorandom lattices of \(k\) symbols

This page was built for publication: Some estimates for character sums and applications