Multiplicative difference sets via additive characters
Recently, \textit{A. Maschietti} [Des. Codes Cryptography 14, No. 1, 89-98 (1998; Zbl 0887.50010)] proposed a new construction of difference sets in the finite field \(\mathbb{F}_{2^m}\). It works by choosing a positive integer \(k\) satisfying two conditions, (1) that \(x\mapsto x^k\) is a permutation on \(\mathbb{F}_{2^m}\), and (2) that \(x\mapsto x+x^k\) is a 2-to-1 mapping on \(\mathbb{F}_{2^m}\). Then \(\{x+x^k:x\in \mathbb{F}_{2^m}\}\setminus \{0\}\) is a difference set in the multiplicative group \(\mathbb{F}_{2^m}^\times\) of \(\mathbb{F}_{2^m}\). \textit{J.-S. No, H. Chung} and \textit{M.-S. Yun} [IEEE Trans. Inf. Theory 44, No. 3, 1278-1282 (1998; Zbl 0912.94017)] considered a variation of that construction: They looked at sets arising from maps of the form \(x\mapsto x^d+(x+1)^d\) and conjectured that if \(m=3k\pm 1\) and \(d=4^k-2^k+1\), then \(\{x^d+(x+1)^d:x\in \mathbb{F}_{2^m}\}\setminus \{0\}\) is a difference set in \(\mathbb{F}_{2^m}^\times\). In the paper under review, not only a new proof of Maschietti's result is given, based on computations with the autocorrelation function and the use of Fourier analysis in the additive group of \(\mathbb{F}_{2^m}\), but also, using similar ideas, the conjecture by No, Chung and Yun is proved for \(m\) odd. Along the way, a stronger form of a celebrated theorem of Welch on the 3-valued cross-correlation of maximal length sequences is proved.
- Two results on maximum nonlinear functions
- More DD difference sets
- Nonlinear functions in abelian groups and relative difference sets.
- Highly nonlinear mappings
- Autocorrelations of vectorial Boolean functions
- On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators
- Paley type sets from cyclotomic classes and Aarasu-Dillon-Player difference sets
- Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\)
- Abelian difference sets of order \(n\) dividing \(\lambda\)
- Special bent and near-bent functions
- APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\)
- Recent progress in algebraic design theory
- Jacobi-like sums and difference sets with Singer parameters
- scientific article; zbMATH DE number 3995699 (Why is no real title available?)
- Quasi-Perfect Sequences and Hadamard Difference Sets
- New cyclic difference sets with Singer parameters
- Infinite families of 3‐designs from APN functions
- Optimal difference systems of sets and partition-type cyclic difference packings
- The Welch-Gong stream cipher -- evolutionary path
- Changing almost perfect nonlinear functions on affine subspaces of small codimensions
- Generic constructions of plateaued idempotents with high algebraic degree
- Exceptional 2-to-1 rational functions
- Optimal difference systems of sets and difference sets
- Correlation distribution of a sequence family generalizing some sequences of Trachtenberg
- Four decades of research on bent functions
- Almost perfect and planar functions
- Near bent functions on a hyperplane
- Highly nonlinear balanced S-boxes with improved bound on unrestricted and generalized nonlinearity
This page was built for publication: Multiplicative difference sets via additive characters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963154)
