Skip to main content
SpringerLink
Log in

Optimum super-simple mixed covering arrays of type a 1 b k−1

  • Published:
Acta Mathematica Sinica, English Series Aims and scope Submit manuscript

Abstract

A mixed covering array (MCA) of type (v 1, v 2,..., v k ), denoted by MCAλ (N; t, k, (v 1, v 2,..., v k )), is an N × k array with entries in the i-th column from a set V i of v i symbols and has the property that each N × t sub-array covers all the t-tuples at least λ times, where 1 ≤ i ≤ k. An MCA λ (N; t, k, (v 1, v 2,..., v k )) is said to be super-simple, if each of its N × (t + 1) sub-arrays contains each (t + 1)-tuple at most once. Recently, it was proved by Tang, Yin and the author that an optimum super-simple MCA of type (a, b, b,..., b) is equivalent to a mixed detecting array (DTA) of type (a, b, b,..., b) with optimum size. Such DTAs can be used to generate test suites to identify and determine the interaction faults between the factors in a component-based system. In this paper, some combinatorial constructions of optimum super-simple MCAs of type (a, b, b,..., b) are provided. By employing these constructions, some optimum super-simple MCAs are then obtained. In particular, the spectrum across which optimum super-simple MCA2(2b 2; 2, 4, (a, b, b, b))′s exist, is completely determined, where 2 ≤ a ≤ b.

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. Bush, K. A.: Orthogonal arrays of index unity. Ann. Math. Stat., 23, 426–434 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bush, K. A.: A generalization of the theorem due to MacNeish. Ann. Math. Stat., 23, 293–295 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chateauneuf, M., Colbourn, C. J., Kreher, D. L.: Covering arrays of strength three. Des. Codes Cryptogr., 16, 235–242 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Colbourn, C. J.: Combinatorial aspects of covering arrays. Matematiche (Catania), 59, 125–172 (2004)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Colbourn, C. J., Launey de W.: Difference matrices. In: Colbourn, C. J., Dinitz, J. H.(Eds.): The CRC handbook of combinatorial designs, FL: CRC press, Boca Raton, 2007

    Google Scholar 

  8. Colbourn, C. J., Martirosyan, S. S., Trung, T. V., et al.: Roux-type constructions for covering arrays of strengths three and four. Des. Codes Cryptogr., 41, 33–57 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Colbourn, C. J., McClary, D. W.: Locating and detecting arrays for interaction faults. J. Comb. Optim., 15, 17–48 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ge, G. N.: On (g, 4, 1)-difference matrices. Discrete Math., 301, 164–174 (2005)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Hartman, S.: On simple and supersimple transversal designs. J. Combin. Des., 8, 311–322 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hedayat, A. S., Slone, N. J. A., Stufken, J.: Orthogonal Arrays, Springer, New York, 1999

    Book  MATH  Google Scholar 

  14. Ji, L. J., Yin, J. X.: Constructions of new orthogonal arrays and covering arrays of strength three. J. Combin. Theory Ser. A, 117, 236–247 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Martirosyan, S., Trung, T. V.: On t-covering arrays. Des. Codes Cryptogr., 32, 323–339 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Shi, C., Tang, Y., Yin, J. X.: The equivalence between optimal detecting arrays and super-simple OAs. Des. Codes Cryptogr., 62, 131–142 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  17. Shi, C., Tang, Y., Yin, J. X.: Optimal locating arrays for at most two faults. Sci. China Math., 55, 197–206 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Shi, C., Tang, Y., Yin, J. X.: Optimum mixed level detecting arrays. Ann. Statist., 42(4), 1546–1563 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  19. Shi, C., Wang, C. M.: Optimum detecting arrays for independent interaction faults. Acta Math. Sin., Engl. Ser., 32(2), 199–212 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  20. Shi, C., Yin, J. X.: Existence of super-simple OAλ(3, 5, v)'s. Des. Codes Cryptogr., 72, 369–380 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Information Science, Shanghai Lixin University of Commerce, Shanghai, 201620, P. R. China

    Ce Shi

Authors
  1. Ce Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ce Shi.

Additional information

Supported by National Natural Science Foundation of China (Grant Nos. 11271280 and 11301342)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shi, C. Optimum super-simple mixed covering arrays of type a 1 b k−1 . Acta. Math. Sin.-English Ser. 33, 153–164 (2017). https://doi.org/10.1007/s10114-017-5684-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10114-017-5684-7

Keywords

MR(2010) Subject Classification

Search

Navigation