Consecutive covering arrays and a new randomness test
DOI10.1016/J.JSPI.2009.11.016zbMATH Open1279.62044OpenAlexW2000832753MaRDI QIDQ2266901FDOQ2266901
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
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
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)
Cites Work
- Title not available (Why is that?)
- Two moments suffice for Poisson approximations: The Chen-Stein method
- Orthogonal arrays. Theory and applications
- Waiting time problems for a two-dimensional pattern
- Runs, scans and urn model distributions: A unified Markov chain approach
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- Binary consecutive covering arrays
- Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
- Runs and scans with applications
- Title not available (Why is that?)
- Distribution Theory of Runs: A Markov Chain Approach
- Title not available (Why is that?)
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- Covering arrays and intersecting codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
- Software and hardware testing using combinatorial covering suites
- Discriminating between sequences of bernoulli and markov-bernoulli trials
- Title not available (Why is that?)
Cited In (3)
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)
