Balance, pattern distribution and linear complexity of M-ary sequences from Sidel'nikov sequences
From MaRDI portal
Publication:6602398
DOI10.1007/S00200-022-00580-5zbMATH Open1547.94296MaRDI QIDQ6602398FDOQ6602398
Authors:
Publication date: 11 September 2024
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Recommendations
- New Families of $M$-Ary Sequences With Low Correlation Constructed From Sidel'nikov Sequences
- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
- On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
- On the Autocorrelation Distributions of Sidel'nikov Sequences
- Linear Complexity over F p of Ternary Sidel’nikov Sequences
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cites Work
- Title not available (Why is that?)
- A class of balanced binary sequences with optimal autocorrelation properties
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- New $M$-Ary Sequence Families With Low Correlation and Large Size
- On the linear complexity of Sidel'nikov sequences over nonprime fields
- Linear Complexity over F p of Ternary Sidel’nikov Sequences
- On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
- On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
- Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
- Linear complexity profile and correlation measure of interleaved sequences
- On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence
- On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$
- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
- One-Error Linear Complexity over F p of Sidelnikov Sequences
- Binary Sequences Derived From Differences of Consecutive Primitive Roots
- New Families of $M$-Ary Sequences With Low Correlation Constructed From Sidel'nikov Sequences
- Shift-inequivalent decimations of the Sidelnikov-Lempel-Cohn-Eastman sequences
- 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?)
- 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
- On the Autocorrelation Distributions of Sidel'nikov Sequences
This page was built for publication: Balance, pattern distribution and linear complexity of \(M\)-ary sequences from Sidel'nikov sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602398)
