相关论文: Improved Strength Four Covering Arrays with Three …
A covering array $\rm{CA}(N;t,k,v)$ of strength $t$ is an $N \times k$ array of symbols from an alphabet of size $v$ such that in every $N \times t$ subarray, every $t$-tuple occurs in at least one row. A covering array is \emph{optimal} if…
A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N;…
A covering array $\mathsf{CA}(N;t,k,v)$ is an $N\times k$ array with entries in $\{1, 2, \ldots , v\}$, for which every $N\times t$ subarray contains each $t$-tuple of $\{1, 2, \ldots , v\}^t$ among its rows. Covering arrays find…
Covering arrays are combinatorial objects that have been successfully applied in the design of test suites for testing systems such as software, circuits and networks, where failures can be caused by the interaction between their…
The focus of this thesis is the study and construction of covering arrays, relying on maximal period sequences and other tools from finite fields. A covering array of strength $t$, denoted $\mathrm{CA}(N; t, k,v)$, is an $N\times k$ array…
A covering array CA(N; t; k; v) is an N x k array on v symbols such that every N x t subarray contains as a row each t-tuple over the v symbols at least once. The minimum N for which a CA(N; t; k; v) exists is called the covering array…
Two vectors $x,y$ in $\mathbb{Z}_g^n$ are $ qualitatively$ $ independent$ if for all pairs $(a,b)\in \mathbb{Z}_g\times \mathbb{Z}_g$, there exists $i\in \{1,2,\ldots,n\}$ such that $(x_i,y_i)=(a,b)$. A covering array on a graph $G$,…
Covering arrays are generalizations of orthogonal arrays that have been widely studied and are used in software testing. The probabilistic method has been employed to derive upper bounds on the sizes of minimum covering arrays and give…
A sequence covering array, denoted \textsf{SCA}$(N;t,v)$, is a set of $N$ permutations of $\{0, \dots, v-1 \}$ such that each sequence of $t$ distinct elements of $\{0, \dots, v-1\}$ reads left to right in at least one permutation. The…
A $t$-covering array with entries from the alphabet ${\cal Q}=\{0,1,\ldots,q-1\}$ is a $k\times n$ stack, so that for any choice of $t$ (typically non-consecutive) columns, each of the $q^{t}$ possible $t$-letter words over ${\cal Q}$…
A covering array $CA(N; t,k,v)$ is an $N \times k$ array $A$ whose each cell takes a value for a $v$-set $V$ called an alphabet. Moreover, the set $V^t$ is contained in the set of rows of every $N \times t$ subarray of $A$. The parameter…
A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called blocks, chosen from a $v$-set, such that each $t$-subset is contained in at least one of the blocks. The number of blocks is the covering's {\em size},…
Modern software systems often consist of many different components, each with a number of options. Although unit tests may reveal faulty options for individual components, functionally correct components may interact in unforeseen ways to…
In an early paper, He and Tang [Biometrika 100 (2013) 254-260] introduced and studied a new class of designs, strong orthogonal arrays, for computer experiments, and characterized such arrays through generalized orthogonal arrays. The…
A $q$-covering design $\mathbb{C}_q(n, k, r)$, $k \ge r$, is a collection $\mathcal X$ of $(k-1)$-spaces of $\mathrm{PG}(n-1, q)$ such that every $(r-1)$-space of $\mathrm{PG}(n-1, q)$ is contained in at least one element of $\mathcal X$ .…
Covering arrays for words of length $t$ over a $d$ letter alphabet are $k \times n$ arrays with entries from the alphabet so that for each choice of $t$ columns, each of the $d^t$ $t$-letter words appears at least once among the rows of the…
We carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity. In the {\sc Test Cover} problem we are given a set $[n]=\{1,...,n\}$ of items together…
Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding…
This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product. Upper bounds on covering codes in NRT spaces are also…
An $(n,k)$ sequence covering array is a set of permutations of $[n]$ such that each sequence of $k$ distinct elements of $[n]$ is a subsequence of at least one of the permutations. An $(n,k)$ sequence covering array is perfect if there is a…