Covering arrays and intersecting codes
From MaRDI portal
Publication:4764685
Cited in
(44)- Packing arrays
- scientific article; zbMATH DE number 2170443 (Why is no real title available?)
- Constructions of difference covering arrays.
- Binary consecutive covering arrays
- Attribute-efficient learning of Boolean functions from Post closed classes
- On the constructions of highly nonlinear zigzag functions and unbiased functions
- Binary Covering Arrays and Existentially Closed Graphs
- Covering and radius-covering arrays: constructions and classification
- A survey of methods for constructing covering arrays
- Constructions of new orthogonal arrays and covering arrays of strength three
- Roux-type constructions for covering arrays of strengths three and four
- On the extremal combinatorics of the Hamming space
- Constructing strength three covering arrays with augmented annealing
- Two-level screening designs derived from binary nonlinear codes
- Covering arrays via set covers
- Covering arrays with mixed alphabet sizes
- Covering arrays on graphs
- Long packing and covering codes
- scientific article; zbMATH DE number 1286223 (Why is no real title available?)
- The solution to Berlekamp's switching game
- Classification of orthogonal arrays by integer programming
- Covering arrays for some equivalence classes of words
- Structures and lower bounds for binary covering arrays
- Partial covering arrays and a generalized Erdős-Ko-Rado property
- On asymmetric coverings and covering numbers
- Problems and algorithms for covering arrays via set covers
- Hidden projection properties of some nonregular fractional factorial designs and their applications
- Locating and detecting arrays for interaction faults
- Tabu search for covering arrays using permutation vectors
- Strength two covering arrays: existence tables and projection
- Constraint models for the covering test problem
- On the lower bound for the length of minimal codes
- Upper bounds for covering arrays by tabu search.
- On the state of strength-three covering arrays
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph
- Factorials experiments, covering arrays, and combinatorial testing
- Conditional expectation algorithms for covering arrays
- Arrays for combinatorial interaction testing: a review on constructive approaches
- The correct solution to Berlekamp's switching game
- Consecutive covering arrays and a new randomness test
- A two-stage algorithm for combinatorial testing
- The maximum number of minimal codewords in an \([n,k]\)-code
- Sign-balanced covering matrices
- t-Covering Arrays: Upper Bounds and Poisson Approximations
This page was built for publication: Covering arrays and intersecting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764685)
