Binary consecutive covering arrays

DOI10.1007/s10463-009-0240-6zbMath1333.62189OpenAlexW2088160983MaRDI QIDQ261836

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

Publication date: 24 March 2016

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10463-009-0240-6

zbMATH Keywords

Markov chainsrandom matricesorthogonal arrays\(t\)-covering arrayscomplete factorial designsconsecutive covering arrays

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Orthogonal arrays, Latin squares, Room squares (05B15) Random matrices (algebraic aspects) (15B52) Factorial statistical designs (62K15)

Related Items

Consecutive detecting arrays for interaction faults ⋮ Consecutive covering arrays and a new randomness test ⋮ Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimation of parameters in the discrete distributions of order k
• Waiting time problems for a sequence of discrete random variables
• Orthogonal arrays. Theory and applications
• Waiting time problems for a two-dimensional pattern
• Joint distributions of numbers of success-runs and failures until the first consecutive \(k\) successes
• 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
• Distribution Theory of Runs: A Markov Chain Approach
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Covering arrays and intersecting codes