Asymptotically most powerful tests for random number generators

DOI10.1016/J.JSPI.2021.07.007zbMath1478.62014OpenAlexW3198846622MaRDI QIDQ2059421

Boris Ya. Ryabko

Publication date: 14 December 2021

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2021.07.007

zbMATH Keywords

random number generators\(p\)-valueShannon entropystatistical testrandomness testing

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Stationary stochastic processes (60G10) Random number generation in numerical analysis (65C10) Statistical aspects of information-theoretic topics (62B10) Source coding (94A29)

Cites Work

• Unnamed Item
• Using information theory approach to randomness testing
• Universal codes as a basis for time series testing
• Twice-universal coding
• Data compression by means of a ``book stack
• Compression-Based Methods of Statistical Analysis and Prediction of Time Series
• TestU01
• A locally adaptive data compression scheme
• A universal algorithm for sequential data compression
• Arithmetic Coding
• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
• Grammar-based codes: a new class of universal lossless source codes
• Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
• Tunstall Code, Khodak Variations, and Random Walks
• Elements of Information Theory

This page was built for publication: Asymptotically most powerful tests for random number generators