Covering array bounds using analytical techniques

From MaRDI portal



Abstract: A t-covering array with entries from the alphabet calQ=0,1,ldots,q1 is a kimesn stack, so that for any choice of t (typically non-consecutive) columns, each of the qt possible t-letter words over calQ appear at least once among the rows of the selected columns. We will show how a combination of the Lov'asz local lemma; combinatorial analysis; Stirling's formula; and Calculus enables one to find better asymptotic bounds for the minimum size of t-covering arrays, notably for t=3,4. Here size is measured in the number of rows, as expressed in terms of the number of columns.











This page was built for publication: Covering array bounds using analytical techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251960)