More constructions of pseudorandom sequences of \(k\) symbols
From MaRDI portal
Publication:2434404
DOI10.1016/J.FFA.2013.09.006zbMath1284.11111OpenAlexW1995074806MaRDI QIDQ2434404
Publication date: 5 February 2014
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2013.09.006
Congruences; primitive roots; residue systems (11A07) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (5)
On the correlation of families of pseudorandom sequences of $k$ symbols ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences ⋮ Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin–Shapiro sequences ⋮ Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I ⋮ More constructions of pseudorandom lattices of \(k\) symbols
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- On a problem of D.H. Lehmer and pseudorandom binary sequences
- On exponential sums in finite fields. II
- On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction
- On finite pseudorandom binary sequences. VI: On \((n^k\alpha)\) sequences
- On finite pseudorandom sequences of \(k\) symbols.
- Construction of pseudorandom binary sequences using additive characters
- On finite pseudorandom sequences of \(k\) symbols
- On finite pseudorandom binary sequences. V: On \((n\alpha)\) and \((n^2\alpha)\) sequences
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- Construction of k-ary pseudorandom elliptic curve sequences
- On the parity of k-th powers modulo p. A generalization of a problem of Lehmer
- Exponential Sums and Goppa Codes: I
- EXPONENTIAL SUMS AND THE DISTRIBUTION OF INVERSIVE CONGRUENTIAL PSEUDORANDOM NUMBERS WITH POWER OF TWO MODULUS
- On finite pseudorandom binary sequences III: The Liouville function, I
- On the difference between a D. H. Lehmer number and its inverse modulo q
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus
- On finite pseudorandom binary sequences IV: The Liouville function, II
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
- A family of pseudorandom binary sequences constructed by the multiplicative inverse
- Lehmer 𝑘-tuples
- 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
- Generalization of a problem of Lehmer.
This page was built for publication: More constructions of pseudorandom sequences of \(k\) symbols
