Design theory
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Lower Bounds for Transversal Covers
Designs, Codes and Cryptography
Constructions for Steiner quadruple systems with a spanning block design
Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
Combinatorial Designs: Constructions and Analysis
Combinatorial Designs: Constructions and Analysis
Constructions of difference covering arrays
Journal of Combinatorial Theory Series A
Cyclic Difference Packing and Covering Arrays
Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Vector sets for exhaustive testing of logic circuits
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the existence of orthogonal arrays OA(3,5,4n+2)
Journal of Combinatorial Theory Series A
A heuristic approach for constructing ternary covering arrays using trinomial coefficients
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
The equivalence between optimal detecting arrays and super-simple OAs
Designs, Codes and Cryptography
Constructions of covering arrays of strength five
Designs, Codes and Cryptography
Further results on the existence of nested orthogonal arrays
Designs, Codes and Cryptography
MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Computational Intelligence - Volume Part II
Super-simple balanced incomplete block designs with block size 5 and index 3
Discrete Applied Mathematics
| Hi-index | 0.00 |
A covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is a kxN array on v symbols. In every txN subarray, each t-tuple column vector occurs at least once. When 'at least' is replaced by 'exactly', this defines an orthogonal array, OA(t,k,v). A difference covering array, or a DCA(k,n;v), over an abelian group G of order v is a kxn array (a"i"j) (1==4 and v@?2 (mod 4), and an OA(3,6,v) for any positive integer v satisfying gcd(v,4)2 and gcd(v,18)3. It is also proved that the size CAN(3,k,v) of a CA(N;3,k,v) cannot exceed v^3+v^2 when k=5 and v=2 (mod 4), or k=6, v=2 (mod 4) and gcd(v,18)3.