scientific article

zbMath1019.11034MaRDI QIDQ2712132

Arne Winterhof

Publication date: 23 October 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite fieldscharacter sums and dc-constrained codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Estimates on exponential sums (11L07) Exponential sums (11T23) Cyclic codes (94B15)

Related Items (13)

Normality of the Thue-Morse function for finite fields along polynomial values ⋮ The additive index of polynomials over finite fields ⋮ Analogues of the Balog-Wooley decomposition for subsets of finite fields and character sums with convolutions ⋮ Character sums over sparse elements of finite fields ⋮ On the distribution of points in orbits of \(\text{PGL}(2,q)\) acting on \(\text{GF}(q^{n})\). ⋮ Finite binary sequences constructed by explicit inversive methods ⋮ Additive double character sums over some structured sets and applications ⋮ Some estimates for character sums and applications ⋮ Two-Source Randomness Extractors for Elliptic Curves for Authenticated Key Exchange ⋮ Primitive elements of finite fields \(\mathbb{F}_{q^r}\) avoiding affine hyperplanes for \(q = 4\) and \(q = 5\) ⋮ On pseudorandom subsets in finite fields. I: Measure of pseudorandomness and support of Boolean functions ⋮ On pseudo-random subsets of \({\mathbb{Z}}_n\) ⋮ Incomplete character sums and polynomial interpolation of the discrete logarithm

This page was built for publication: