Construct stronger covering arrays and lower bounds

Construct additional covering arrays and establish lower bounds on the size of (m × n, R)-covering arrays.

Background

The paper generalizes covering sequences to doubly periodic covering arrays and presents folding and shift-based constructions. These constructions provide upper bounds, but the authors identify the need for both further construction methods and lower bounds governing the minimum area or size of covering arrays.