RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]

Mat. Vopr. Kriptogr., 2014, Volume 5, Issue 4, Pages 63–71 (Mi mvk135)

Poisson approximation for the distribution of the frequency of a given pattern in the outcome sequence of the MCV-generator
V. G. Mikhailov

References

1. Pohl P., “Description of MCV, a pseudo-random number generator”, Scand. Actuarial J., 1976:1 (1976), 1–14  crossref  mathscinet  zmath
2. Mezhennaya N. M., Mikhailov V. G., “Otsenki i predelnye teoremy normalnogo tipa dlya chisla edinits v vykhodnoi posledovatelnosti generatora Pola”, Matematicheskie voprosy kriptografii, 4:4 (2013), 95–107  mathnet
3. Chryssaphinou O., Papastavridis S., “A limit theorem for the number of non-overlapping occurrence of a pattern in a sequence of independent trials”, J. Appl. Prob., 25:2 (1988), 428–431  crossref  mathscinet  zmath
4. Barbour A. D., Holst L., Janson S., Poisson Approximation, Oxford University Press, Oxford, 1992  mathscinet  zmath
5. Mikhailov V. G., “Yavnye otsenki v predelnykh teoremakh dlya summ sluchainykh indikatorov”, Obozr. prikl. i promyshl. matem., 1:4 (1994), 580–617


© Steklov Math. Inst. of RAS, 2025