A Generalization of a Theorem due to MacNeish
From MaRDI portal
Cited in
(30)- Some new 2-resolvable Steiner quadruple systems
- New constructions for IPP codes
- Problems and algorithms for covering arrays
- Detecting arrays and their optimality
- Further results on the existence of nested orthogonal arrays
- A construction of variable strength covering arrays
- Consecutive detecting arrays for interaction faults
- Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s
- A tight bound for frameproof codes viewed in terms of separating hash families
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Optimality and constructions of locating arrays
- Optimum detecting arrays for independent interaction faults
- Row-column factorial designs with strength at least 2
- Generalized covering designs and clique coverings
- A construction and decomposition of orthogonal arrays with non-prime-power numbers of symbols on the complement of a Baer subplane
- On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
- A General Product Construction for Error Correcting Codes
- An approach of constructing mixed-level orthogonal arrays of strength 3
- Improved bounds for separating hash families
- A note on connections among criteria for asymmetrical factorials
- scientific article; zbMATH DE number 1512990 (Why is no real title available?)
- Mixed orthogonal arrays, \(k\)-dimensional \(M\)-part Sperner multifamilies, and full multitransversals
- Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)
- On the existence of orthogonal arrays OA(3,5,4n+2)
- New results on orthogonal arrays \(\mathrm{OA}(3,5,4n+2)\)
- The equivalence between optimal detecting arrays and super-simple OAs
- Construction of optimal orthogonal partition
- New progress on orthogonal arrays \(\mathrm{OA}(3, 6,(v)\)
- A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities
- Constructions of new orthogonal arrays and covering arrays of strength three
This page was built for publication: A Generalization of a Theorem due to MacNeish
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5812202)
