Almost difference sets and their sequences with optimal autocorrelation
From MaRDI portal
Publication:4544734
DOI10.1109/18.959271zbMATH Open1008.05027OpenAlexW2162378625MaRDI QIDQ4544734FDOQ4544734
Authors: K. T. Arasu, Cunsheng Ding, Tor Helleseth, P. Vijay Kumar, Halvard Martinsen 
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2ae6a80ee59860894d78ee439cb872ccd0253012
Recommendations
Cryptography (94A60) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Cited In (64)
- The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations
- Some new constructions of difference systems of sets
- Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences
- Partial direct product difference sets and almost quaternary sequences
- Title not available (Why is that?)
- Introduction to the special issue dedicated to Cunsheng Ding on the occasion of his 60th birthday
- New classes of asymptotically optimal spectrally-constrained sequences derived from cyclotomy
- Legendre G‐array pairs and the theoretical unification of several G‐array families
- Some nonexistence results on generalized difference sets
- Some results on generalized difference sets
- Codebooks from almost difference sets
- Cyclotomic constructions of external difference families and disjoint difference families
- Optimal and efficient designs for fMRI experiments via two-level circulant almost orthogonal arrays
- The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude
- Some new balanced and almost balanced quaternary sequences with low autocorrelation
- Fourier transforms and bent functions on finite groups
- The existence of almost difference families
- Preface to the special issue on ArasuFest
- Quasi-orthogonal cocycles, optimal sequences and a conjecture of Littlewood
- Divisible difference sets, relative difference sets and sequences with ideal autocorrelation
- Two families of nearly optimal codebooks
- 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude
- The linear complexity of a class of binary sequences with optimal autocorrelation
- Constructions of almost difference sets from finite fields
- Constructions of \((q,K,\lambda, t,Q)\) almost difference families
- New optimal binary sequences with period \(4p\) via interleaving Ding-Helleseth-Lam sequences
- A note on almost difference sets in nonabelian groups
- 2-adic complexity of binary sequences with interleaved structure
- G-perfect nonlinear functions
- Construction of a near-optimal quasi-complementary sequence set from almost difference set
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
- Optimal and perfect difference systems of sets from \(q\)-ary sequences with difference-balanced property
- A note on difference families from cyclotomy
- Generalized difference sets and almost perfect sequences
- A new family of almost difference sets and some necessary conditions
- Almost difference sets in nonabelian groups
- Cyclic codes from cyclotomic sequences of order four
- Two applications of relative difference sets: difference triangles and negaperiodic autocorrelation functions
- Binary periodic sequences with 2-level autocorrelation values
- Sequences with small correlation
- External Difference Families from Finite Fields
- New partial geometric difference sets and partial geometric difference families
- Partial geometric difference families
- Strongly regular graphs constructed from \(p\)-ary bent functions
- Shift-inequivalent decimations of the Sidelnikov-Lempel-Cohn-Eastman sequences
- Constructions of partitioned difference families
- Construction of cyclotomic codebooks nearly meeting the Welch bound
- New \((q,K,\lambda)\)-ADFs via cyclotomy
- Merit factors of polynomials derived from difference sets
- A general construction of binary interleaved sequences of period \(4{N}\) with optimal autocorrelation
- A generalization of combinatorial designs and related codes
- Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
- A note on cyclic almost difference families
- Exhaustive search for optimal minimum peak sidelobe binary sequences up to length 80
- Nonlinear functions and difference sets on group actions
- Almost supplementary difference sets and quaternary sequences with optimal autocorrelation
- Partitioned difference families and almost difference sets
- Relative and almost linking systems
- Optimal difference systems of sets and partition-type cyclic difference packings
- Title not available (Why is that?)
- Constructions of almost difference families
- Optimal difference systems of sets and difference sets
- The existence of \((q,k,\lambda ,t)\)-ADFs for \(k=4,5,6\)
This page was built for publication: Almost difference sets and their sequences with optimal autocorrelation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544734)
