Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests

DOI10.1134/S0032946007010061MaRDI QIDQ415707zbMATH OpenOpenAlexFDO

Authors Konstantin Yu. Gorbunov

Publication date 9 May 2012

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946007010061

Mathematics Subject Classification ID

Combinatorial probability (60C05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Kolmogorov-Loveland stochasticity for finite strings
• Statistical properties of finite sequences with high Kolmogorov complexity
• An easy criterion for randomness
• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
• scientific article; zbMATH DE number 4071998

Cites work

• Mathematical metaphysics of randomness

Cited in

(2)

• Consecutive covering arrays and a new randomness test
• Study of the bounds on the number of basic sets in a test.

This page was built for publication: Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415707)