Binary consecutive covering arrays

DOI10.1007/S10463-009-0240-6MaRDI QIDQ261836zbMATH OpenOpenAlexFDO

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

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

\(t\)-covering arrayscomplete factorial designsconsecutive covering arraysMarkov chainsorthogonal arraysrandom matrices

Mathematics Subject Classification ID

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

Recommendations

• Consecutive covering arrays and a new randomness test
• A survey of binary covering arrays
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Structures and lower bounds for binary covering arrays
• t-covering arrays generated by a tiling probability model

Cites work

• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Covering arrays and intersecting codes
• Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
• Distribution Theory of Runs: A Markov Chain Approach
• Estimation of parameters in the discrete distributions of order k
• Families of \(k\)-independent sets
• scientific article; zbMATH DE number 5177325 (Why is no real title available?)
• scientific article; zbMATH DE number 1959509 (Why is no real title available?)
• Joint distributions of numbers of success-runs and failures until the first consecutive \(k\) successes
• Orthogonal arrays. Theory and applications
• Runs and scans with applications
• Runs, scans and urn model distributions: A unified Markov chain approach
• Two applications (for search theory and truth functions) of Sperner type theorems
• Waiting time problems for a sequence of discrete random variables
• Waiting time problems for a two-dimensional pattern

Cited in

(6)

• 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
• Sequence Covering Arrays and Linear Extensions
• Structures and lower bounds for binary covering arrays
• A survey of binary covering arrays

This page was built for publication: Binary consecutive covering arrays

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