scientific article; zbMATH DE number 1286223

DOI10.1002/(SICI)1520-6610(1999)7:3%3C185::AID-JCD3%3E3.0.CO;2-3MaRDI QIDQ4242741zbMATH OpenFDO

Authors Brett Stevens, Eric Mendelsohn

Publication date 7 July 1999

Full work available at URL https://doi.org/10.1002/(SICI)1520-6610(1999)7:3%3C185::AID-JCD3%3E3.0.CO;2-3

zbMATH Keywords

covering arraysorthogonal arraystransversal coverstransversal designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)

Recommendations

• scientific article; zbMATH DE number 2188416
• Lower bounds for transversal covers
• New constructions for covering designs

Cites work

• Capacities: From information theory to extremal set theory
• Compressing inconsistent data
• Covering arrays and intersecting codes
• Families of \(k\)-independent sets
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• scientific article; zbMATH DE number 898421 (Why is no real title available?)
• scientific article; zbMATH DE number 898422 (Why is no real title available?)
• scientific article; zbMATH DE number 2188416 (Why is no real title available?)
• On qualitatively independent partitions and related problems
• On the maximum number of qualitative independent partitions
• Qualitative independence and Sperner problems for directed graphs
• Sperner capacities
• The construction of antipodal triple systems by simulated annealing
• Two applications (for search theory and truth functions) of Sperner type theorems

Cited in

(17)

• Covering arrays of strength 3 and 4 from holey difference matrices
• Lower bounds for transversal covers
• Constructions of difference covering arrays.
• Problems and algorithms for covering arrays
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Covering arrays on graphs
• Group divisible covering designs with block size 4: A type of covering array with row limit
• Generalized covering designs and clique coverings
• Structures and lower bounds for binary covering arrays
• scientific article; zbMATH DE number 2188416 (Why is no real title available?)
• Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
• Packing arrays
• An extension of a construction of covering arrays
• Generalized group divisible covering designs
• Cover starters for covering arrays of strength two
• Constructing strength three covering arrays with augmented annealing
• Constructions of new orthogonal arrays and covering arrays of strength three

Describes a project that uses

Uses Software

• AETG

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242741)