Covering arrays of strength three (Q1299897)

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.