A Pseudorandom Sequence--How Random Is It?
From MaRDI portal
Publication:2871083
DOI10.2307/2324917zbMath1279.94047OpenAlexW4242286965MaRDI QIDQ2871083
Jan Mycielski, Andrzej Ehrenfeucht
Publication date: 22 January 2014
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/1235103
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (5)
Related-Key Attacks Against Full Hummingbird-2 ⋮ A linearly computable measure of string complexity ⋮ The Linus Sequence ⋮ On the Ehrenfeucht-Mycielski sequence ⋮ A construction of a 𝜆-Poisson generic sequence
This page was built for publication: A Pseudorandom Sequence--How Random Is It?
