Covering arrays and intersecting codes
From MaRDI portal
Publication:4764685
DOI10.1002/jcd.3180010106zbMath0828.05023OpenAlexW2166614386MaRDI QIDQ4764685
Publication date: 4 May 1995
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.3180010106
Linear codes (general theory) (94B05) Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40)
Related Items (39)
Attribute-efficient learning of Boolean functions from Post closed classes ⋮ Two-level screening designs derived from binary nonlinear codes ⋮ The correct solution to Berlekamp's switching game ⋮ On the extremal combinatorics of the Hamming space ⋮ Constraint models for the covering test problem ⋮ Roux-type constructions for covering arrays of strengths three and four ⋮ The solution to Berlekamp's switching game ⋮ Binary Covering Arrays and Existentially Closed Graphs ⋮ Packing arrays ⋮ Covering arrays on product graphs ⋮ The maximum number of minimal codewords in an \([n,k\)-code] ⋮ On the lower bound for the length of minimal codes ⋮ Locating and detecting arrays for interaction faults ⋮ Hidden projection properties of some nonregular fractional factorial designs and their applications ⋮ Structures and lower bounds for binary covering arrays ⋮ Constructions of difference covering arrays. ⋮ Constructing strength three covering arrays with augmented annealing ⋮ Upper bounds for covering arrays by tabu search. ⋮ Covering arrays via set covers ⋮ Unnamed Item ⋮ Strength two covering arrays: existence tables and projection ⋮ Tabu search for covering arrays using permutation vectors ⋮ A two-stage algorithm for combinatorial testing ⋮ Classification of orthogonal arrays by integer programming ⋮ Partial covering arrays and a generalized Erdös-Ko-Rado property ⋮ Constructions of new orthogonal arrays and covering arrays of strength three ⋮ Consecutive covering arrays and a new randomness test ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ t-Covering Arrays: Upper Bounds and Poisson Approximations ⋮ On the number of minimal codewords in codes generated by the adjacency matrix of a graph ⋮ A survey of methods for constructing covering arrays ⋮ Factorials experiments, covering arrays, and combinatorial testing ⋮ Covering arrays on graphs ⋮ Sign-balanced covering matrices ⋮ Problems and algorithms for covering arrays via set covers ⋮ On the constructions of highly nonlinear zigzag functions and unbiased functions ⋮ On the state of strength-three covering arrays ⋮ Binary consecutive covering arrays
Cites Work
This page was built for publication: Covering arrays and intersecting codes
