On orthogonal arrays of strength 3 and 5 achieving Rao's bound (Q1080855)

An orthogonal array (N,n,q,t) is an \(N\times n\)-matrix A with entries q symbols 0,1,2,...,q-1 such that in any \(N\times t\)-submatrix of A every possible row vector occurs equally often. The author characterizes A-s (orthogonal arrays with parameters (N,n,q,3)) achieving \textit{C. R. Rao}'s bound [J. R. Statist. Soc. 9, 128-139 (1947; Zbl 0031.06201)].