Roux-type constructions for covering arrays of strengths three and four
From MaRDI portal
Publication:851777
DOI10.1007/s10623-006-0020-8zbMath1182.05026OpenAlexW2101657310MaRDI QIDQ851777
Tran van Trung, Charles J. Colbourn, Sosina S. Martirosyan, Robert A. II Walker
Publication date: 22 November 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-006-0020-8
Orthogonal arrays, Latin squares, Room squares (05B15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatorial aspects of packing and covering (05B40)
Related Items (29)
Perfect Hash Families: Constructions and Existence ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ Unnamed Item ⋮ Perfect hash families of strength three with three rows from varieties on finite projective geometries ⋮ A construction for strength-3 covering arrays from linear feedback shift register sequences ⋮ Consecutive detecting arrays for interaction faults ⋮ Locating and detecting arrays for interaction faults ⋮ An extension of a construction of covering arrays ⋮ Constructions of covering arrays of strength five ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ 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 ⋮ Randomized post-optimization of covering arrays ⋮ Covering arrays from cyclotomy ⋮ D-optimal designs with interaction coverage ⋮ Mixed covering arrays of strength three with few factors ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ 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 ⋮ Resolvable covering arrays ⋮ Improving two recursive constructions for covering arrays ⋮ In-parameter-order strategies for covering perfect hash families ⋮ MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit construction of exponential sized families of k-independent sets
- Orthogonal arrays. Theory and applications
- Covering arrays of strength three
- Upper bounds for covering arrays by tabu search.
- Perfect hash families: Probabilistic methods and explicit constructions
- New constructions for IPP codes
- Problems and algorithms for covering arrays
- On \(t\)-covering arrays
- On the state of strength-three covering arrays
- Iterative Exhaustive Pattern Generation for Logic Testing
- Group construction of covering arrays
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- Covering arrays and intersecting codes
- Products of mixed covering arrays of strength two
- Covering arrays of higher strength from permutation vectors
This page was built for publication: Roux-type constructions for covering arrays of strengths three and four
