Consecutive covering arrays and a new randomness test

DOI10.1016/J.JSPI.2009.11.016MaRDI QIDQ2266901zbMATH OpenOpenAlexFDO

Authors Anant P. Godbole, F. S. Milienos, Markos V. Koutras

Publication date 26 February 2010

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.2009.11.016

zbMATH Keywords

total variation distanceChen-Stein methodMarkov chain embeddingcovering arraysrandomness test

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Parametric hypothesis testing (62F03) Multivariate distribution of statistics (62H10) Approximations to statistical distributions (nonasymptotic) (62E17) Orthogonal arrays, Latin squares, Room squares (05B15)

Recommendations

• Random sequential covering
• Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests
• On perfect sequence covering arrays
• A new randomness test for bit sequences
• scientific article; zbMATH DE number 36205
• The Serial Test for Congruential Pseudorandom Numbers Generated by Inversions
• scientific article; zbMATH DE number 222729
• Randomized postoptimization of covering arrays
• Binary consecutive covering arrays
• On Complete Convergence for Arrays of Random Elements

Cites work

• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 1959509 (Why is no real title available?)
• scientific article; zbMATH DE number 1774199 (Why is no real title available?)
• scientific article; zbMATH DE number 806878 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3323559 (Why is no real title available?)
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Binary consecutive covering arrays
• Covering arrays and intersecting codes
• Discriminating between sequences of bernoulli and markov-bernoulli trials
• Distribution Theory of Runs: A Markov Chain Approach
• Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
• Families of \(k\)-independent sets
• Orthogonal arrays. Theory and applications
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• Runs and scans with applications
• Runs, scans and urn model distributions: A unified Markov chain approach
• Software and hardware testing using combinatorial covering suites
• Two applications (for search theory and truth functions) of Sperner type theorems
• Two moments suffice for Poisson approximations: The Chen-Stein method
• Waiting time problems for a two-dimensional pattern

Cited in

(3)

• Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
• Consecutive detecting arrays for interaction faults
• Binary consecutive covering arrays

This page was built for publication: Consecutive covering arrays and a new randomness test

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