✦ LIBER ✦

Consecutive covering arrays and a new randomness test

✍ Scribed by A.P. Godbole; M.V. Koutras; F.S. Milienos

Book ID: 108193400
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 255 KB
Volume: 140
Category: Article
ISSN: 0378-3758
DOI: 10.1016/j.jspi.2009.11.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Binary consecutive covering arrays

✍ A. P. Godbole; M. V. Koutras; F. S. Milienos 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 285 KB

A new matrix test for randomness

✍ Otokar Grošek; Milan Vojvoda; Róbert Krchnavý 📂 Article 📅 2009 🏛 Springer Vienna 🌐 English ⚖ 167 KB

Covering arrays and intersecting codes

✍ N. J. A. Sloane 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 680 KB

A t-covering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, and one wishes to minimize k for given values of n and t. The case t = 2 was solved by Rkn

Bound on the cardinality of a covering o

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

✍ K. Yu. Gorbunov 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 392 KB

A TEST FOR RANDOMNESS OF DIRECTIONS

✍ G. S. Watson 📂 Article 📅 1956 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

A test for randomness in behaviour

✍ Tom Snijders 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 421 KB