On the state of strength‐three covering arrays | Zendy

Chateauneuf M. | Zendy; Kreher D. L. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

On the state of strength‐three covering arrays

Author(s) -

Chateauneuf M.,

Kreher D. L.

Publication year - 2002

Publication title -

journal of combinatorial designs

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.618

H-Index - 34

eISSN - 1520-6610

pISSN - 1063-8539

DOI - 10.1002/jcd.10002

Subject(s) - mathematics , combinatorics , constructive , product (mathematics) , column (typography) , order (exchange) , discrete mathematics , computer science , geometry , process (computing) , finance , connection (principal bundle) , economics , operating system

A covering array of size N , strength t , degree k , and order υ is a k × N array on υ symbols in which every t × N subarray contains every possible t × 1 column at least once. We present explicit constructions, constructive upper bounds on the size of various covering arrays, and compare our results with those of a commercial product. Applications of covering arrays include software testing, drug screening, and data compression. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 217–238, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10002

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research