Strength two covering arrays: existence tables and projection (Q2470443): Difference between revisions

A covering array \(\mathrm{CA}(N;t,k,v)\) is an \(N \times k\) array such that every \(N \times t\) subarray contains all \(t\)-tuples from \(v\) symbols at least once. The parameter \(t\) is called the strength of the covering array. If ``at least once'' is replaced by ``exactly once'', we get the definition of orthogonal arrays. The smallest value of \(N\) for which a \(\mathrm{CA}(N;t,k,v)\) exists is denoted by \(\mathrm{CAN}(t,k,v)\). This paper presents tables of the best known upper bounds on \(\mathrm{CAN}(2,k,v)\) for \(v \leq 25\) and \(k \leq 20000\). A new construction of covering arrays from orthogonal arrays is also introduced.