Pages that link to "Item:Q4764685"
From MaRDI portal
The following pages link to Covering arrays and intersecting codes (Q4764685):
Displaying 35 items.
- Binary consecutive covering arrays (Q261836) (← links)
- Two-level screening designs derived from binary nonlinear codes (Q287399) (← links)
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- Structures and lower bounds for binary covering arrays (Q449145) (← links)
- A two-stage algorithm for combinatorial testing (Q519759) (← links)
- Packing arrays (Q596146) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Attribute-efficient learning of Boolean functions from Post closed classes (Q828191) (← links)
- Constraint models for the covering test problem (Q850459) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- Constructing strength three covering arrays with augmented annealing (Q924952) (← links)
- Tabu search for covering arrays using permutation vectors (Q953845) (← links)
- Constructions of new orthogonal arrays and covering arrays of strength three (Q965209) (← links)
- The solution to Berlekamp's switching game (Q1115849) (← links)
- Hidden projection properties of some nonregular fractional factorial designs and their applications (Q1412375) (← links)
- Constructions of difference covering arrays. (Q1421336) (← links)
- Upper bounds for covering arrays by tabu search. (Q1428561) (← links)
- Sign-balanced covering matrices (Q1584386) (← links)
- On the constructions of highly nonlinear zigzag functions and unbiased functions (Q1603459) (← links)
- Covering arrays via set covers (Q1742691) (← links)
- The correct solution to Berlekamp's switching game (Q1886357) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789) (← links)
- Factorials experiments, covering arrays, and combinatorial testing (Q2071532) (← links)
- Consecutive covering arrays and a new randomness test (Q2266901) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Problems and algorithms for covering arrays via set covers (Q2333828) (← links)
- Covering arrays on product graphs (Q2409504) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Strength two covering arrays: existence tables and projection (Q2470443) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Covering arrays on graphs (Q2565691) (← links)
- On the state of strength-three covering arrays (Q3150159) (← links)
- On the lower bound for the length of minimal codes (Q6080135) (← links)
