On \(t\)-covering arrays
From MaRDI portal
Publication:1877364
DOI10.1023/B:DESI.0000029232.40302.6dzbMath1046.05020OpenAlexW2055249322MaRDI QIDQ1877364
Tran van Trung, Sosina S. Martirosyan
Publication date: 16 August 2004
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:desi.0000029232.40302.6d
Orthogonal arrays, Latin squares, Room squares (05B15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial aspects of packing and covering (05B40)
Related Items
Roux-type constructions for covering arrays of strengths three and four ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ Detecting arrays for effects of single factors ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ Locating and detecting arrays for interaction faults ⋮ Constructing strength three covering arrays with augmented annealing ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Tabu search for covering arrays using permutation vectors ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ Randomized post-optimization of covering arrays ⋮ Covering arrays from cyclotomy ⋮ Mixed optimization combinatorial method for constructing covering arrays ⋮ 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 ⋮ Improving two recursive constructions for covering arrays ⋮ Distributing hash families with few rows
