Skip to main content
Springer Nature Link
Log in

Roux-type constructions for covering arrays of strengths three and four

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

A covering array CA(N;t,k,v) is an N  ×  k array such that every N  ×  t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. Recursive constructions for covering arrays of strengths 3 and 4 are developed, generalizing many “Roux-type” constructions. A numerical comparison with current construction techniques is given through existence tables for covering arrays.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. N Alon (1986) ArticleTitleExplicit construction of exponential sized families of k-independent sets Discrete Math 58 191–193 Occurrence Handle0588.05003 Occurrence Handle829076 Occurrence Handle10.1016/0012-365X(86)90161-5

    Article  MATH  MathSciNet  Google Scholar 

  2. M Atici SS Magliveras DR Stinson WD Wei (1996) ArticleTitleSome recursive constructions for perfect hash families J Combin Designs 4 353–363 Occurrence Handle0914.68087 Occurrence Handle1402122 Occurrence Handle10.1002/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E

    Article  MATH  MathSciNet  Google Scholar 

  3. J Bierbrauer H Schellwatt (2000) ArticleTitleAlmost independent and weakly biased arrays: efficient constructions and cryptologic applications.Adv Cryptol (Crypto 2000) Lecture Notes Comput Sci 1880 533–543 Occurrence Handle0995.94552

    MATH  Google Scholar 

  4. SR Blackburn (2000) ArticleTitlePerfect hash families: probabilistic methods and explicit constructions J Combin Theory – Ser A 92 54–60 Occurrence Handle0962.68042 Occurrence Handle1783938 Occurrence Handle10.1006/jcta.1999.3050

    Article  MATH  MathSciNet  Google Scholar 

  5. Boroday SY (1998) Determining essential arguments of Boolean functions (Russian). In: Proc conference on industrial mathematics, Taganrog, pp 59–61

  6. Chateauneuf MA, Colbourn CJ, Kreher DL, Covering arrays of strength 3. Designs Codes Cryptogr 16:235–242

  7. MA Chateauneuf DL Kreher (2002) ArticleTitleOn the state of strength three covering arrays J Combin Designs 10 IssueID4 217–238 Occurrence Handle1003.05022 Occurrence Handle1905540 Occurrence Handle10.1002/jcd.10002

    Article  MATH  MathSciNet  Google Scholar 

  8. Cohen MB (2004) Designing test suites for software interaction testing. Ph.D. Thesis, University of Auckland and private communications (2005)

  9. Cohen MB, Colbourn CJ, Ling ACH (to appear) Constructing strength 3 covering arrays with augmented annealing. Discrete Math

  10. DM Cohen SR Dalal ML Fredman GC Patton (1997) ArticleTitleThe AETG system: an approach to testing based on combinatorial design IEEE Trans Software Eng 23 IssueID7 437–444 Occurrence Handle10.1109/32.605761

    Article  Google Scholar 

  11. CJ Colbourn (2004) ArticleTitleCombinatorial aspects of covering arrays Le Matematiche (Catania) 58 121–167

    Google Scholar 

  12. Colbourn CJ (to appear) Strength two covering arrays: existence tables and projection. Discrete Math

  13. CJ Colbourn JH Dinitz (Eds) (1996) The CRC handbook of combinatorial designs CRC Press Boca Raton Occurrence Handle0836.00010

    MATH  Google Scholar 

  14. CJ Colbourn SS Martirosyan GL Mullen D Shasha GB Sherwood JL Yucas (2006) ArticleTitleProducts of mixed covering arrays of strength two J Combin Designs 14 124–138 Occurrence Handle1134.05306 Occurrence Handle2202133 Occurrence Handle10.1002/jcd.20065

    Article  MATH  MathSciNet  Google Scholar 

  15. AP Godbole DE Skipper RA Sunley (1996) ArticleTitlet-covering arrays: upper bounds and Poisson approximations Combin Probab Comput 5 105–117 Occurrence Handle0865.60008 Occurrence Handle1400957

    MATH  MathSciNet  Google Scholar 

  16. Hartman A (2005) Software and hardware testing using combinatorial covering suites. In: Graph theory, combinatorics and algorithms: interdisciplinary applications. M.C. Golunbic and I.B.A. Hartman (eds) Springer, Boston, pp. 237–266

  17. A Hartman L Raskin (2004) ArticleTitleProblems and algorithms for covering arrays Discrete Math 284 IssueID(1–3 149–156 Occurrence Handle1044.05029 Occurrence Handle2071905 Occurrence Handle10.1016/j.disc.2003.11.029

    Article  MATH  MathSciNet  Google Scholar 

  18. Hedayat AS, Sloane NJA, Stufken J (1999) Orthogonal arrays, theory and applications. Springer

  19. B Hnich S Prestwich E Selensky (2005) ArticleTitleConstraint-based approaches to the covering test problem Lecture Notes Comput Sci 3419 172–186 Occurrence Handle1078.68748 Occurrence Handle10.1007/11402763_13

    Article  MATH  Google Scholar 

  20. Lidl R, Niederreiter H (eds) Finite fields, 2nd ed Cambridge. England. Cambridge University Press

  21. SS Martirosyan CJ Colbourn (2005) ArticleTitleRecursive constructions for covering arrays Bayreuther Math Schriften 74 266–275 Occurrence Handle2220252 Occurrence Handle1122.05019

    MathSciNet  MATH  Google Scholar 

  22. S Martirosyan T Van Trung (2004) ArticleTitleOn t-covering arrays Designs Codes Cryptogr 32 323–339 Occurrence Handle1046.05020 Occurrence Handle10.1023/B:DESI.0000029232.40302.6d

    Article  MATH  Google Scholar 

  23. K Meagher B Stevens (2005) ArticleTitleGroup construction of covering arrays J Combin Designs 13 70–77 Occurrence Handle1057.05023 Occurrence Handle2103603 Occurrence Handle10.1002/jcd.20035

    Article  MATH  MathSciNet  Google Scholar 

  24. K Nurmela (2004) ArticleTitleUpper bounds for covering arrays by tabu search Discrete Appl Math 138 143–152 Occurrence Handle1034.05013 Occurrence Handle2057607 Occurrence Handle10.1016/S0166-218X(03)00291-9

    Article  MATH  MathSciNet  Google Scholar 

  25. Roux G (1987) k-Propriétés dans les tableaux de n colonnes: cas particulier de la k-surjectivité et de la k-permutivité. Ph.D. Thesis, Université de Paris

  26. GB Sherwood SS Martirosyan CJ Colbourn (2006) ArticleTitleCovering arrays of higher strength from permutation vectors J Combin Designs 14 202–213 Occurrence Handle1092.05010 Occurrence Handle2214495 Occurrence Handle10.1002/jcd.20067

    Article  MATH  MathSciNet  Google Scholar 

  27. NJA Sloane (1993) ArticleTitleCovering arrays and intersecting codes J. Combin Designs 1 51–63 Occurrence Handle0828.05023 Occurrence Handle1303523

    MATH  MathSciNet  Google Scholar 

  28. DR Stinson R Wei L Zhu (2000) ArticleTitleNew constructions for perfect hash families and related structures using combinatorial designs and codes J Combin Designs 8 189–2000 Occurrence Handle0956.68159 Occurrence Handle1752734 Occurrence Handle10.1002/(SICI)1520-6610(2000)8:3<189::AID-JCD4>3.0.CO;2-A

    Article  MATH  MathSciNet  Google Scholar 

  29. DT Tang CL Chen (1984) ArticleTitleIterative exhaustive pattern generation for logic testing IBM J Res Develop 28 212–219 Occurrence Handle0529.94020 Occurrence Handle10.1147/rd.282.0212

    Article  MATH  Google Scholar 

  30. T Trung Particlevan S Martirosyan (2005) ArticleTitleNew constructions for IPP codes Designs Codes Cryptogr 35 227–239 Occurrence Handle1077.94028 Occurrence Handle10.1007/s10623-005-6402-5

    Article  MATH  Google Scholar 

  31. P Turán (1941) ArticleTitleOn an extremal problem in graph theory (Hungarian) Mat Fiz Lapok 48 436–452 Occurrence Handle0026.26903 Occurrence Handle18405

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering, Arizona State University, P.O. Box 878809, Tempe, 85287, AZ, USA

    Charles J. Colbourn & Robert A. Walker II

  2. Mathematical Sciences, University of Houston-Clear Lake, 2700 Bay Area Blvd., Houston, TX, 77058, USA

    Sosina S. Martirosyan

  3. Institut für Experimentelle Mathematik, Universität Duisburg-Essen, Ellernstrasse 29, 45326, Essen, Germany

    Tran Van Trung

Authors
  1. Charles J. Colbourn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sosina S. Martirosyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tran Van Trung
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Robert A. Walker II
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Charles J. Colbourn.

Additional information

Communicated by D. Hachenberger

Rights and permissions

Reprints and permissions

About this article

Cite this article

Colbourn, C.J., Martirosyan, S.S., Van Trung, T. et al. Roux-type constructions for covering arrays of strengths three and four. Des Codes Crypt 41, 33–57 (2006). https://doi.org/10.1007/s10623-006-0020-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-006-0020-8

Keywords

AMS Classification

Search

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy