We improve a well-known asymptotic bound on the number of monotonic selection rules for covering of an arbitrary randomness test by frequency tests. More precisely, we prove that, for any set S (arbitrary test) of binary sequences of sufficiently large length L, where ∨S∨ ≤ 2 L(1−δ), for sufficiently small δ there exists a polynomial (in 1/δ) set of monotonic selection rules (frequency tests) which guarantee that, for each sequence t ∈ S, a subsequence can be selected such that the product of its length by the squared deviation of the fraction of zeros in it from 1/2 is of the order of at least 0.5 ln 2 L[δ/ln(1/δ)](1 − 2 ln ln(1/δ)/ln(1/δ)).
Problems of Information Transmission – Springer Journals
Published: Apr 20, 2007
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera