On the pseudorandom properties of k-ary Sidel'nikov sequences
From MaRDI portal
Publication:6163786
Recommendations
- On finite pseudorandom sequences of \(k\) symbols.
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- On linear recursion and pseudorandomness
- On the \(d\)-ary generalized Legendre-Sidelnikov sequence
- On the pseudorandom properties of \(d\)-ary generalized two-prime Sidelnikov sequences
Cites work
- scientific article; zbMATH DE number 3463514 (Why is no real title available?)
- scientific article; zbMATH DE number 3091928 (Why is no real title available?)
- A class of balanced binary sequences with optimal autocorrelation properties
- A large family of pseudorandom sequences of \(k\) symbols with length \(pq\)
- An Upper Bound for the Sum ∑ a + H n = a + 1 f(n) for a Certain Class of Functions f
- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
- Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
- Cross Correlation of Sidel'nikov Sequences and Their Constant Multiples
- Estimates of character sums with exponential function
- Extension of the notion of collision and avalanche effect to sequences of \(k\) symbols
- Families of sequences with optimal Hamming-correlation properties
- Hamming correlation properties of the array structure of Sidelnikov sequences
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
- Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
- Linear Complexity over F p of Ternary Sidel’nikov Sequences
- Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
- Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences
- More constructions of pseudorandom sequences of \(k\) symbols
- Multiplicative character sums of Fermat quotients and pseudorandom 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
- New Construction of $M$-Ary Sequence Families With Low Correlation From the Structure of Sidelnikov Sequences
- New Families of $M$-Ary Sequences With Low Correlation Constructed From Sidel'nikov Sequences
- On a trigonometric inequality of Vinogradov
- On a trigonometric inequality of Vinogradov
- On a trigonometric sum of Vinogradov.
- On finite pseudorandom sequences of \(k\) symbols.
- On the Autocorrelation Distributions of Sidel'nikov 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$
- On the Sidel'nikov Sequences as Frequency-Hopping Sequences
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- On the linear complexity of Sidel'nikov sequences over nonprime fields
- On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
- On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
- One-Error Linear Complexity over F p of Sidelnikov Sequences
- Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\)
- Sets of Optimal Frequency-Hopping Sequences
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
This page was built for publication: On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163786)