Multiplicative difference sets via additive characters
From MaRDI portal
Publication:1963154
DOI10.1023/A:1026435428030zbMath0944.05012OpenAlexW1546467724MaRDI QIDQ1963154
Publication date: 24 January 2000
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026435428030
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Other character sums and Gauss sums (11T24) Cyclic codes (94B15)
Related Items (22)
Correlation distribution of a sequence family generalizing some sequences of Trachtenberg ⋮ Autocorrelations of vectorial Boolean functions ⋮ Abelian difference sets of order \(n\) dividing \(\lambda\) ⋮ On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators ⋮ New cyclic difference sets with Singer parameters ⋮ Optimal difference systems of sets and partition-type cyclic difference packings ⋮ Infinite families of 3‐designs from APN functions ⋮ Four decades of research on bent functions ⋮ Almost perfect and planar functions ⋮ Special bent and near-bent functions ⋮ Nonlinear functions in abelian groups and relative difference sets. ⋮ Near bent functions on a hyperplane ⋮ Highly nonlinear balanced S-boxes with improved bound on unrestricted and generalized nonlinearity ⋮ APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\) ⋮ Quasi-Perfect Sequences and Hadamard Difference Sets ⋮ Paley type sets from cyclotomic classes and Aarasu-Dillon-Player difference sets ⋮ Optimal difference systems of sets and difference sets ⋮ Two results on maximum nonlinear functions ⋮ More DD difference sets ⋮ Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\) ⋮ Highly nonlinear mappings ⋮ Recent progress in algebraic design theory
This page was built for publication: Multiplicative difference sets via additive characters
