On the pseudorandom properties of k-ary Sidel'nikov sequences

DOI10.3934/AMC.2021038OpenAlexW3198244381MaRDI QIDQ6163786FDOQ6163786

Authors:

Publication date: 30 June 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2021038

correlation character sum collision avalanche effect Sidel'nikov sequence well-distribution $k$ symbol

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50) Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

Title not available (Why is that?)
On a trigonometric inequality of Vinogradov
More constructions of pseudorandom sequences of $k$ symbols
Pseudo-randomness of certain sequences of $k$ symbols with length $pq$
Multiplicative character sums of Fermat quotients and pseudorandom sequences
Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences
Sets of Optimal Frequency-Hopping Sequences
An Upper Bound for the Sum ∑ a + H n = a + 1 f(n) for a Certain Class of Functions f
Families of sequences with optimal Hamming-correlation properties
On finite pseudorandom sequences of $k$ symbols.
Title not available (Why is that?)
A class of balanced binary sequences with optimal autocorrelation properties
Extension of the notion of collision and avalanche effect to sequences of $k$ symbols
On the Sidel'nikov Sequences as Frequency-Hopping 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
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
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
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
On a trigonometric sum of Vinogradov.
On a trigonometric inequality of Vinogradov
A large family of pseudorandom sequences of $k$ symbols with length $pq$
Estimates of character sums with exponential function
New Families of $M$-Ary Sequences With Low Correlation Constructed From Sidel'nikov 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
New Construction of $M$-Ary Sequence Families With Low Correlation From the Structure of Sidelnikov Sequences
Hamming correlation properties of the array structure of Sidelnikov sequences
On the Autocorrelation Distributions of Sidel'nikov 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)