Covering arrays of strength three

From MaRDI portal





A covering array of size \(N\), degree \(k\), order \(v\), and strength \(t\) is a \(k \times N\) array with entries from a \(v\)-set such that in any \(t \times N\) subarray every \(t \times 1\) column occurs at least once. The authors give new constructions for covering arrays of strength three and give constructive upper bounds for the size of a covering array of strength three.




Cited in
(33)








This page was built for publication: Covering arrays of strength three

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