Covering arrays of higher strength from permutation vectors
- 17 August 2005
- journal article
- research article
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 14 (3), 202-213
- https://doi.org/10.1002/jcd.20067
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Group construction of covering arraysJournal of Combinatorial Designs, 2004
- Problems and algorithms for covering arraysDiscrete Mathematics, 2004
- On t-Covering ArraysDesigns, Codes and Cryptography, 2004
- On the state of strength‐three covering arraysJournal of Combinatorial Designs, 2002
- Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic ApplicationsLecture Notes in Computer Science, 2000
- Orthogonal ArraysPublished by Springer Science and Business Media LLC ,1999
- Covering Arrays of Strength ThreeDesigns, Codes and Cryptography, 1999
- The AETG system: an approach to testing based on combinatorial designIEEE Transactions on Software Engineering, 1997
- t-Covering Arrays: Upper Bounds and Poisson ApproximationsCombinatorics, Probability and Computing, 1996
- Covering arrays and intersecting codesJournal of Combinatorial Designs, 1993