## Abstract A covering array __t__β__CA__ (__n__, __k__, __g__) is a __k__βΓβ__n__ array on a set of __g__ symbols with the property that in each __t__βΓβ__n__ subarray, every __t__βΓβ1 column appears at least once. This paper improves many of the best known upper bounds on __n__ for covering array
β¦ LIBER β¦
Constructions of difference covering arrays
β Scribed by Jianxing Yin
- Book ID
- 108167104
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 242 KB
- Volume
- 104
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Group construction of covering arrays
β
Karen Meagher; Brett Stevens
π
Article
π
2004
π
John Wiley and Sons
π
English
β 112 KB
New Constructions of Covering Codes
β
Alexander A. Davydov
π
Article
π
2001
π
Springer
π
English
β 95 KB
Constructions of covering triangulations
β
AndrΓ© Bouchet
π
Article
π
1982
π
John Wiley and Sons
π
English
β 704 KB
## Abstract Let __G__ be a graph with a known triangular embedding in a surface __S__, and consider __G__~(__m__)~, the composition of __G__ with an independant set of order __m.__ The purpose of this paper is to construct a triangular embedding of __G__~(__m__)~ into a surface magnified image by u
A survey of methods for constructing cov
β
V. V. Kuliamin; A. A. Petukhov
π
Article
π
2011
π
SP MAIK Nauka/Interperiodica
π
English
β 482 KB
Covering Arrays of Strength Three
β
M. A. Chateauneuf; Charles J. Colbourn; D. L. Kreher
π
Article
π
1999
π
Springer
π
English
β 52 KB
Constructions of Hadamard Difference Set
β
Richard M. Wilson; Qing Xiang
π
Article
π
1997
π
Elsevier Science
π
English
β 439 KB