Detecting arrays for effects of single factors
From MaRDI portal
Publication:6086392
DOI10.4171/8ecm/19zbMath1526.05029OpenAlexW4384300468MaRDI QIDQ6086392
Violet R. Syrotiuk, Charles J. Colbourn
Publication date: 10 November 2023
Published in: European Congress of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/8ecm/19
Combinatorics in computer science (68R05) Linear codes (general theory) (94B05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimum detecting arrays for independent interaction faults
- Optimum mixed level detecting arrays
- The equivalence between optimal detecting arrays and super-simple OAs
- Covering and radius-covering arrays: constructions and classification
- Constructions and bounds for separating hash families
- Four MOLS of order 10 with a hole of order 2
- Matrices of zeros and ones with fixed row and column sum vectors
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Orthogonal arrays. Theory and applications
- The packing problem in statistics, coding theory and finite projective spaces
- Generalized hashing and parent-identifying codes.
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- On a combinatorial framework for fault characterization
- Separating interaction effects using locating and detecting arrays
- A hierarchical framework for recovery in compressive sensing
- New lower bounds on error-correcting ternary, quaternary and quinary codes
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Two combinatorial covering theorems
- On \(t\)-covering arrays
- Detecting arrays and their optimality
- New bounds on the maximum size of Sperner partition systems
- Locating and detecting arrays for interaction faults
- On generalized separating hash families
- On covering sets and error-correcting codes
- A Sperner-type theorem for set-partition systems
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
- Sperner Partition Systems
- A survey of combinatorial testing
- Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
- A constructive proof of the general lovász local lemma
- Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- New Bounds for Frameproof Codes
- Randomized Post-optimization for t-Restrictions
- Perfect Hash Families: Constructions and Existence
- Bounds on codes over an alphabet of five elements
