AbstractThe discovery is reported of tight single-change covering designs (tsccd's) with v=20 and k=5. All previously known tsccd's had k=2,3 or 4. The computational difficulties encountered in the computer construction of the new designs are described and discussed
AbstractWe prove that some t-designs are minimal (t + 1)-coverings, thus finding some new covering n...
The article gives constructions of disjoint 5‐designs obtained from permutation groups and extremal ...
AbstractA t-design on a point-set S is a collection Dof subsets of S, all of the same cardinality, w...
AbstractThe discovery is reported of tight single-change covering designs (tsccd's) with v=20 and k=...
AbstractStandardised tight single-change covering designs with v = 12, k = 4 are enumerated and clas...
A single-change circular covering design (scccd) based on the set [v] = {1, . . . ,v} with block siz...
A single-change circular covering design (scccd) based on the set [v] = {1,..., v} with block size ...
A double-change covering design (dccd) is an ordered set of blocks with block size k is an ordered c...
AbstractIn this article we look at pair covering designs with a block size of 5 and v≡0(mod4). The n...
A \textbf{single change covering design} is a $v$-set $X$ and an ordered list $\cL$ of $b$ blocks of...
A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called bl...
A double-change circular covering design (dcccd) is an ordered set of blocks with block size k is an...
AbstractNew recursive and direct constructions for transversal designs of index more than one are es...
AbstractA t-(ν, k, λ) design is a pair (X, B), where B is a collection of k-subsets (called blocks) ...
AbstractUniform designs have been widely used in computer experiments, as well as in industrial expe...
AbstractWe prove that some t-designs are minimal (t + 1)-coverings, thus finding some new covering n...
The article gives constructions of disjoint 5‐designs obtained from permutation groups and extremal ...
AbstractA t-design on a point-set S is a collection Dof subsets of S, all of the same cardinality, w...
AbstractThe discovery is reported of tight single-change covering designs (tsccd's) with v=20 and k=...
AbstractStandardised tight single-change covering designs with v = 12, k = 4 are enumerated and clas...
A single-change circular covering design (scccd) based on the set [v] = {1, . . . ,v} with block siz...
A single-change circular covering design (scccd) based on the set [v] = {1,..., v} with block size ...
A double-change covering design (dccd) is an ordered set of blocks with block size k is an ordered c...
AbstractIn this article we look at pair covering designs with a block size of 5 and v≡0(mod4). The n...
A \textbf{single change covering design} is a $v$-set $X$ and an ordered list $\cL$ of $b$ blocks of...
A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called bl...
A double-change circular covering design (dcccd) is an ordered set of blocks with block size k is an...
AbstractNew recursive and direct constructions for transversal designs of index more than one are es...
AbstractA t-(ν, k, λ) design is a pair (X, B), where B is a collection of k-subsets (called blocks) ...
AbstractUniform designs have been widely used in computer experiments, as well as in industrial expe...
AbstractWe prove that some t-designs are minimal (t + 1)-coverings, thus finding some new covering n...
The article gives constructions of disjoint 5‐designs obtained from permutation groups and extremal ...
AbstractA t-design on a point-set S is a collection Dof subsets of S, all of the same cardinality, w...
DOI
Add to ORKG