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