Covering arrays of strength 3 and 4 from holey difference matrices

DOI10.1007/s10623-008-9235-1zbMath1247.05042OpenAlexW2067070599MaRDI QIDQ1009124

Yang Li, Jianxing Yin, Lijun Ji

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9235-1

zbMATH Keywords

Orthogonal arrayCovering arrayCovering array numberHoley difference matrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal arrays, Latin squares, Room squares (05B15) Fault detection; testing in circuits and networks (94C12)

Related Items (6)

Constructions of covering arrays of strength five ⋮ Some constructions for \(t\) pairwise orthogonal diagonal Latin squares based on difference matrices ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Mixed covering arrays of strength three with few factors ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Resolvable covering arrays

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Roux-type constructions for covering arrays of strengths three and four
• Constructions of new orthogonal arrays and covering arrays of strength three
• On qualitatively independent partitions and related problems
• Constructions of difference covering arrays.
• Further results on optimal optical orthogonal codes with weight 4.
• Cyclic designs with block size 4 and related optimal optical orthogonal codes
• Problems and algorithms for covering arrays
• On \(t\)-covering arrays
• Strength two covering arrays: existence tables and projection
• The combinatorial construction for a class of optimal optical orthogonal codes
• Cyclic difference packing and covering arrays.
• On the state of strength-three covering arrays
• Vector sets for exhaustive testing of logic circuits
• Partial λ-Geometries and Generalized Hadamard Matrices Over Groups
• Compressing inconsistent data
• Products of mixed covering arrays of strength two

This page was built for publication: Covering arrays of strength 3 and 4 from holey difference matrices