Covering Arrays

Authored by: Charles J. Colbourn

Handbook of Combinatorial Designs

Print publication date:  November  2006
Online publication date:  November  2006

Print ISBN: 9781584885061
eBook ISBN: 9781420010541
Adobe ISBN:


 Download Chapter




A covering array CAλ(N; t, k, v) is an N × k array. In every N × t subarray, each t-tuple occurs at least λ times. Then t is the strength of the coverage of interactions, k is the number of components (degree), and v is the number of symbols for each component (order). Only the case when λ = 1 is treated; the subscript is then omitted in the notation. The size N is omitted when inessential in the context.

Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.