Covering arrays and intersecting codes

DOI10.1002/JCD.3180010106zbMATH Open0828.05023OpenAlexW2166614386MaRDI QIDQ4764685FDOQ4764685

Authors: N. J. A. Sloane 

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

Recommendations

• Covering arrays of strength three
• On the state of strength-three covering arrays
• Item:QQ726106
• Item:QQ726106

zbMATH Keywords

intersecting codescovering arraysexistence problem

Mathematics Subject Classification ID

Other designs, configurations (05B30) Linear codes (general theory) (94B05) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Title not available (Why is that?)

Cited In (44)

• Packing arrays
• 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
• On the extremal combinatorics of the Hamming space
• Roux-type constructions for covering arrays of strengths three and four
• 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
• Title not available (Why is that?)
• Classification of orthogonal arrays by integer programming
• Covering arrays for some equivalence classes of words
• The solution to Berlekamp's switching game
• 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
• Strength two covering arrays: existence tables and projection
• Tabu search for covering arrays using permutation vectors
• 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
• Consecutive covering arrays and a new randomness test
• The correct solution to Berlekamp's switching game
• A two-stage algorithm for combinatorial testing
• The maximum number of minimal codewords in an \([n,k]\)-code
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Sign-balanced covering matrices
• Title not available (Why is that?)

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)