Skip to main content
SpringerLink
Log in

Augmentation of Covering Arrays of Strength Two

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Augmentation is an operation to increase the number of symbols in a covering array, without unnecessarily increasing the number of rows. For covering arrays of strength two, one type of augmentation forms a covering array on \(v\) symbols from one on \(v-1\) symbols together with \(v-1\) covering arrays each on two symbols. A careful analysis of the structure of the optimal binary covering arrays underlies an augmentation operation that reduces the number of rows required. Consequently a number of covering array numbers are improved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chateauneuf, M.A., Kreher, D.L.: On the state of strength-three covering arrays. J. Combin. Des. 10, 217–238 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Colbourn, C.J.: Combinatorial aspects of covering arrays. Le Matematiche (Catania) 58, 121–167 (2004)

    Google Scholar 

  3. Colbourn, C.J.: Covering array tables (2005–2013). http://www.public.asu.edu/ccolbou/src/tabby

  4. Colbourn, C.J.: Strength two covering arrays: existence tables and projection. Discrete Math. 308, 772–786 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  5. Colbourn, C.J.: Covering arrays and hash families. In: Information Security and Related Combinatorics, NATO Peace and Information Security, pp. 99–136. IOS Press, Amsterdam (2011)

  6. Colbourn, C.J., Kéri, G., Rivas Soriano, P.P., Schlage-Puchta, J.-C.: Covering and radius-covering arrays: constructions and classification. Discrete Appl. Math. 158, 1158–1190 (2010)

  7. Daykin, D.E.: A simple proof of the Kruskal–Katona theorem. J. Combin. Theory A 17, 252–253 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  8. Frankl, P.: A new short proof for the Kruskal–Katona theorem. Discrete Math. 48, 327–329 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hartman, A.: Software and hardware testing using combinatorial covering suites. In: Golumbic, M.C., Hartman, I.B.-A. (eds.) Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, pp. 237–266. Springer, Norwell (2005)

    Chapter  Google Scholar 

  10. Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Math. 284, 149–156 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Katona, G.O.H.: A theorem of finite sets. In: Erdős, P., Katona, G. (eds.) Theory of Graphs, pp. 187–207. Akademia Kiadó, Budapest (1966)

    Google Scholar 

  12. Katona, G.O.H.: Two applications (for search theory and truth functions) of Sperner type theorems. Periodica Math. 3, 19–26 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kleitman, D., Spencer, J.: Families of k-independent sets. Discrete Math. 6, 255–262 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kruskal, J.B.: The number of simplices in a complex. In: Bellman, R. (ed.). Mathematical Optimization Techniques, pp. 251–278. University of California Press, California (1963)

  15. Nayeri, P., Colbourn, C.J., Konjevod, G.: Randomized postoptimization of covering arrays. Eur. J. Combin. 34, 91–103 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  16. Réyni, A.: Found. Probab. Wiley, New York (1971)

    Google Scholar 

  17. Sauer, N., Spencer, J.: Edge disjoint placement of graphs. J. Combin. Theory Ser. B 25, 295–302 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ, 85287-8809, USA

    Charles J. Colbourn

  2. State Key Laboratory of Software Development Environment, Beihang University, Beijing, 100191, China

    Charles J. Colbourn

Authors
  1. Charles J. Colbourn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Charles J. Colbourn.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Colbourn, C.J. Augmentation of Covering Arrays of Strength Two. Graphs and Combinatorics 31, 2137–2147 (2015). https://doi.org/10.1007/s00373-014-1519-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-014-1519-9

Keywords

Search

Navigation