Shift-inequivalent decimations of the Sidelnikov-Lempel-Cohn-Eastman sequences

DOI10.1007/S10623-019-00697-8zbMATH Open1433.05053arXiv1809.04010OpenAlexW2998709205MaRDI QIDQ2302157FDOQ2302157

Authors: Şaban Alaca, Goldwyn Millar 

Publication date: 25 February 2020

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

Abstract: We consider the problem of finding maximal sets of shift-inequivalent decimations of Sidelnikov-Lempel-Cohn-Eastman (SLCE) sequences (as well as the equivalent problem of determining the multiplier groups of the almost difference sets associated with these sequences). We derive a numerical necessary condition for a residue to be a multiplier of an SLCE almost difference set. Using our necessary condition, we show that if $p$ is an odd prime and $S$ is an SLCE almost difference set over $mathbb{F}_p,$ then the multiplier group of $S$ is trivial. Consequently, for each odd prime $p,$ we obtain a family of $phi(p-1)$ shift-inequivalent balanced periodic sequences (where $phi$ is the Euler-Totient function) each having period $p-1$ and nearly perfect autocorrelation.

Full work available at URL: https://arxiv.org/abs/1809.04010

Recommendations

• On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
• Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
• On Decimations of $\ell$-Sequences
• Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
• A class of exponential sequences with shift-invariant discriminators
• Shifted powers in Lucas-Lehmer sequences
• GENERALIZED DECIMATION INVARIANT SEQUENCES IN DIMENSION N
• Decimation-invariant sequences and their automaticity
• scientific article; zbMATH DE number 3920953
• Correction to: ``On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences

zbMATH Keywords

autocorrelationcross-correlationGauss sumsJacobi sumsdifference setsCDMAalmost difference setsfeedback shift registersSidel'nikov sequencesSidelnikov-Lempel-Cohn-Eastman sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Sequences (mod (m)) (11B50) Exponential sums (11T23)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Generators and irreducible polynomials over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Character sums and difference sets
• Algebraic Shift Register Sequences
• Title not available (Why is that?)
• Cyclic projective planes
• Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets
• Cyclic difference sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some New Difference Sets
• Almost difference sets and their sequences with optimal autocorrelation
• New Design of Quaternary Low-Correlation Zone Sequence Sets and Quaternary Hadamard Matrices
• Decomposition fields of difference sets
• On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
• A class of mutually inequivalent circulant weighing matrices
• On the pure Jacobi sums
• Some results on multipliers and numerical multiplier groups of difference sets
• Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
• New <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>-Ary Sequence Families With Low Correlation From the Array Structure of Sidelnikov Sequences
• Cross Correlation of Sidel'nikov Sequences and Their Constant Multiples
• Title not available (Why is that?)
• On fast M-sequence transforms (Corresp.)
• A Construction of a New Family of $M$-ary Sequences With Low Correlation From Sidel'nikov Sequences
• Multiplicative Characters, the Weil Bound, and Polyphase Sequence Families With Low Correlation
• New Construction of $M$-Ary Sequence Families With Low Correlation From the Structure of Sidelnikov Sequences

Cited In (2)

• Counting the decimation classes of binary vectors with relatively prime length and density
• Balance, pattern distribution and linear complexity of \(M\)-ary sequences from Sidel'nikov sequences

This page was built for publication: Shift-inequivalent decimations of the Sidelnikov-Lempel-Cohn-Eastman sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302157)