Constructing new covering arrays from LFSR sequences over finite fields

Let q be a prime power and q be the finite field with q elements. A q-ary m-sequence is a linear recurrence sequence of elements from q with the maximum possible period. A covering array CA(N;t,k,v) of strength t is a N×k array with entries from an alphabet of size v, with the property that any N×m subarray has at least one row equal to every possible m-t