Abstract
AbstractA covering array of strength is an array of symbols from an alphabet of size such that in every subarray, every ‐tuple occurs in at least one row. A covering array is optimal if it has the smallest possible for given , , and , and uniform if every symbol occurs or times in every column. Before this paper, the only known optimal covering arrays for were orthogonal arrays, covering arrays with constructed from Sperner's Theorem and the Erdős‐Ko‐Rado Theorem, and 11 other parameter sets with and . In all these cases, there is a uniform covering array with the optimal size. It has been conjectured that there exists a uniform covering array of optimal size for all parameters. In this paper, a new lower bound as well as structural constraints for small uniform strength‐2 covering arrays is given. Moreover, covering arrays with small parameters are studied computationally. The size of an optimal strength‐2 covering array with and is now known for 21 parameter sets. Our constructive results continue to support the conjecture.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
