On the state of strength-three covering arrays
From MaRDI portal
Publication:3150159
DOI10.1002/jcd.10002zbMath1003.05022OpenAlexW1997203758MaRDI QIDQ3150159
M. A. Chateauneuf, Donald L. Kreher
Publication date: 29 September 2002
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.10002
Related Items (42)
Problems and algorithms for covering arrays ⋮ Constraint models for the covering test problem ⋮ Mixed covering arrays on graphs of small treewidth ⋮ Roux-type constructions for covering arrays of strengths three and four ⋮ Covering arrays, augmentation, and quilting arrays ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ Unnamed Item ⋮ Covering schemes of strength \(t\) ⋮ A construction for strength-3 covering arrays from linear feedback shift register sequences ⋮ Ordered covering arrays and upper bounds on covering codes ⋮ Consecutive detecting arrays for interaction faults ⋮ Augmentation of covering arrays of strength two ⋮ Constructing new covering arrays from LFSR sequences over finite fields ⋮ Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods ⋮ An extension of a construction of covering arrays ⋮ Improved strength four covering arrays with three symbols ⋮ Constructing strength three covering arrays with augmented annealing ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Covering array EXtender ⋮ Strength two covering arrays: existence tables and projection ⋮ Tabu search for covering arrays using permutation vectors ⋮ A two-stage algorithm for combinatorial testing ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ Classification of orthogonal arrays by integer programming ⋮ Constructions of new orthogonal arrays and covering arrays of strength three ⋮ Randomized post-optimization of covering arrays ⋮ Covering arrays from cyclotomy ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Mixed covering arrays of strength three with few factors ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ Optimal and near-optimal mixed covering arrays by column expansion ⋮ Explicit constructions for perfect hash families ⋮ Covering arrays of strength 3 and 4 from holey difference matrices ⋮ Linear hash families and forbidden configurations ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Merging covering arrays and compressing multiple sequence alignments ⋮ A survey of methods for constructing covering arrays ⋮ Cover starters for covering arrays of strength two ⋮ Improving two recursive constructions for covering arrays ⋮ Covering arrays on graphs ⋮ Bounds for covering codes over large alphabets
Uses Software
Cites Work
- On the maximum number of qualitative independent partitions
- New hash functions and their use in authentication and set equality
- Universal classes of hash functions
- Lower bounds for transversal covers
- Covering arrays of strength three
- Upper bounds for covering arrays by tabu search.
- Perfect hash families: Probabilistic methods and explicit constructions
- Sperner capacities
- Two applications (for search theory and truth functions) of Sperner type theorems
- Oblivious transfers and intersecting codes
- Subquadratic zero-knowledge
- Covering arrays and intersecting codes
- Intersecting codes and independent families
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the state of strength-three covering arrays
