Cover starters for covering arrays of strength two

DOI10.1016/j.disc.2011.10.026zbMath1237.05026MaRDI QIDQ764881

Jose Torres-Jimenez, Jason R. Lobb, Brett Stevens, Peter Danziger, Charles J. Colbourn

Publication date: 16 March 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.026

zbMATH Keywords

covering array; interaction testing; cover starter

Mathematics Subject Classification ID

05B15: Orthogonal arrays, Latin squares, Room squares

Related Items

Constructing new covering arrays from LFSR sequences over finite fields, Covering array EXtender, Resolvable covering arrays

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering and radius-covering arrays: constructions and classification
• Optimal and near-optimal mixed covering arrays by column expansion
• Merging covering arrays and compressing multiple sequence alignments
• Covering arrays of strength three
• Upper bounds for covering arrays by tabu search.
• Adaptive versus nonadaptive attribute-efficient learning
• Locating and detecting arrays for interaction faults
• Strength two covering arrays: existence tables and projection
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• A survey of combinatorial testing
• Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
• On the state of strength-three covering arrays
• Randomized Postoptimization of Covering Arrays
• Covering arrays with mixed alphabet sizes
• Group construction of covering arrays
• Products of mixed covering arrays of strength two