Resolvable Covering Arrays
Two powerful recursive constructions of covering arrays of strengths three and four use difference covering arrays (DCAs). However, what is required in these constructions is not the algebraic structure of differences in a group, but rather that the DCAs produce covering arrays that are resolvable. Both constructions are strengthened by using resolvable covering arrays in place of DCAs. Many new difference covering arrays are found by computational methods, and resolvable covering arrays that do not arise from DCAs are produced. Improvements for bounds on covering array numbers are shown to be substantial.
KeywordsInteraction faults Locating array Covering array
AMS Subject Classification05B15
Unable to display preview. Download preview PDF.
- Colbourn, C. J. 2011a. Covering array tables. http://www.public.asu.edu/∼ccolbou/src/tabby.
- Colbourn, C. J., 2011b. Covering arrays and hash families. In Information security and related combinatorics, NATO Peace and Information Security, 99–136. Amsterdam, The Netherlands: IOS Press.Google Scholar
- Niskanen, S., and P. R. J. Östergård. 2003. Cliquer user’s guide, version 1.0. Technical Report Tech. Rep. T48, Communications Laboratory, Helsinki University of Technology, Espoo, Finland.Google Scholar