Abstract
A k × n array with entries from a q-letter alphabet is called a t-covering array if each t × n submatrix contains amongst its columns each one of the q t different words of length t that can be produced by the q letters. In the present article we use a probabilistic approach based on an appropriate Markov chain embedding technique, to study a t-covering problem where, instead of looking at all possible t × n submatrices, we consider only submatrices of dimension t × n with its rows being consecutive rows of the original k × n array. Moreover, an exact formula is established for the probability distribution function of the random variable, which enumerates the number of deficient submatrices (i.e., submatrices with at least one missing word, amongst their columns), in the case of a k × n binary matrix (q = 2) obtained by realizing kn Bernoulli variables.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aki S. (1992) Waiting time problems for a sequence of discrete random variables. Annals of the Institute of Statistical Mathematics 44: 363–378
Aki S., Hirano K. (1989) Estimation of parameters in the discrete-distributions of order k. Annals of the Institute of Statistical Mathematics 41: 47–61
Aki S., Hirano K. (1995) Joint distributions of numbers of success-runs and failures until the first consecutive k successes. Annals of the Institute of Statistical Mathematics 47: 225–235
Aki S., Hirano K. (2004) Waiting time problems for a two-dimensional pattern. Annals of the Institute of Statistical Mathematics 56: 169–182
Balakrishnan N., Koutras M.V. (2002) Runs, scans and applications. Wiley, New York
Carey, P. A., Godbole, A. P. (2008). Partial covering arrays and a generalized Erdös-Ko-Rado property (under revision).
Charalambides Ch.A. (2002) Enumerative combinatorics. Chapman & Hall, Boca Raton
Colbourn C.J. (2004) Combinatorial aspects of covering arrays. Le Matematiche (Catania) 58: 121–167
Dalal S.R., Mallows C.L. (1998) Factor-covering designs for testing software. Technometrics 40: 234–243
Fu J.C., Koutras M.V. (1994) Distribution theory of runs: A Markov chain approach. Journal of the American Statistical Association 89: 1050–1058
Fu J.C., Lou W.Y.W. (2003) Distribution theory of runs and patterns and its applications: A finite markov chain imbedding approach. World Scientific, Singapore
Godbole A.P., Skipper D.E., Sunley R.A. (1996) t-covering arrays: Upper bounds and Poisson approximations. Combinatorics, Probability and Computing 5: 105–118
Hartman A. (2006) Software and hardware testing using combinatorial covering suites. In: Golumbic M.C., Hartman A. (eds) Interdisciplinary applications of graph theory, combinatorics and algorithms. Springer, Berlin, pp 237–266
Hedayat A.S., Sloane N.J.A., Stufken J. (1999) Orthogonal arrays. Springer, New York
Katona G. (1973) Two applications (for search theory and truth functions) of Sperner type theorems. Periodica Mathematica Hungarica 3: 19–26
Kleitman D., Spencer J. (1973) Families of k-independent sets. Discrete Mathematics 6: 255–262
Koutras M.V. (2003) Applications of Markov chains to the distribution theory of runs and patterns. In: Shanbhag D.N., Rao C.R. (eds) Handbook of statistics: Vol. 21. Stochastic processe, modeling and simulation. Elsevier, Amsterdam
Koutras M.V., Alexandrou V.A. (1995) Runs, scans and urn model distributions: A unified Markov chain approach. Annals of the Institute of Statistical Mathematics 47: 743–766
Renyi A. (1971) Foundations of probability. Wiley, New York
Sloane N.J.A. (1993) Covering arrays and intersecting codes. Journal of Combinatorial Designs 1: 51–63
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Godbole, A.P., Koutras, M.V. & Milienos, F.S. Binary consecutive covering arrays. Ann Inst Stat Math 63, 559–584 (2011). https://doi.org/10.1007/s10463-009-0240-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10463-009-0240-6