A Generalization of a Theorem due to MacNeish
From MaRDI portal
Publication:5812202
DOI10.1214/aoms/1177729449zbMath0047.01702OpenAlexW1995069390MaRDI QIDQ5812202
Publication date: 1952
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177729449
Related Items
Problems and algorithms for covering arrays, A construction and decomposition of orthogonal arrays with non-prime-power numbers of symbols on the complement of a Baer subplane, An approach of constructing mixed-level orthogonal arrays of strength \(\geqslant 3\), Improved bounds for separating hash families, Covering arrays on product graphs, On the existence of orthogonal arrays OA\((3,5,4n+2)\), A construction of \(t\)-fold perfect splitting authentication codes with equal deception probabilities, Consecutive detecting arrays for interaction faults, Detecting arrays and their optimality, Further results on the existence of nested orthogonal arrays, New results on orthogonal arrays \(\mathrm{OA}(3,5,4n+2)\), A note on connections among criteria for asymmetrical factorials, Row-column factorial designs with strength at least 2, The equivalence between optimal detecting arrays and super-simple OAs, Unnamed Item, Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\), Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s, A tight bound for frameproof codes viewed in terms of separating hash families, Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals, Constructions of new orthogonal arrays and covering arrays of strength three, A General Product Construction for Error Correcting Codes, New constructions for IPP codes, A construction of variable strength covering arrays, Arrays for combinatorial interaction testing: a review on constructive approaches, Generalized covering designs and clique coverings, Optimality and constructions of locating arrays, On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler, Some new 2-resolvable Steiner quadruple systems, Optimum detecting arrays for independent interaction faults
