Abstract
AbstractA covering array is an array A such that each cell of A takes a value from a v‐set V, which is called the alphabet. Moreover, the set is contained in the set of rows of every subarray of A. The parameter N is called the size of an array and denotes the smallest N for which a exists. It is well known that [10]. In this paper, we derive two upper bounds on using an algorithmic approach to the Lovász local lemma also known as entropy compression.
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.
