scientific article; zbMATH DE number 1512990
From MaRDI portal
Publication:4508621
DOI<311::AID-JCD1>3.0.CO;2-1 10.1002/1520-6610(2000)8:5<311::AID-JCD1>3.0.CO;2-1zbMath0966.05010MaRDI QIDQ4508621
Publication date: 16 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Super-simple pairwise balanced designs with block sizes 3 and 4 ⋮ The Existence of Mixed Orthogonal Arrays with Four and Five Factors of Strength Two ⋮ Super-simple twofold Steiner pentagon systems ⋮ \(4^2\)-decomposable super-simple \((v,4,8)\)-BIBDs ⋮ The existence of λ $\lambda $‐decomposable super‐simple (4,2λ) $(4,2\lambda )$‐GDDs of type gu ${g}^{u}$ with λ=2,4 $\lambda =2,4$ ⋮ Consecutive detecting arrays for interaction faults ⋮ Decomposable super‐simple BIBDs with block size 4 and index 4, 6 ⋮ Super-simple balanced incomplete block designs with block size 5 and index 3 ⋮ Super-simple (\(v\),\,5,\,2)-designs. ⋮ Super-simple group divisible designs with block size 4 and index \(\lambda = 7,8\) ⋮ Completely reducible super-simple designs with block size five and index two ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s ⋮ Super-simple, pan-orientable and pan-decomposable GDDs with block size 4 ⋮ Super-simple BIBDs with block size 4 and index 7 ⋮ Super-simple \((5, 4)\)-GDDs of group type \(g^u\) ⋮ Super-simple group divisible designs with block size 4 and index 9 ⋮ Super-simple group divisible designs with block size 4 and index 2 ⋮ On super-simple group divisible designs with block size four and index \(\lambda =3,4,6\) ⋮ Super-simple balanced incomplete block designs with block size 4 and index 9 ⋮ Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4 ⋮ Super-simple balanced incomplete block designs with block size 4 and index 5 ⋮ Super-simple group divisible designs with block size 4 and index 5 ⋮ Further results on 2-uniform states arising from irredundant orthogonal arrays ⋮ Optimum detecting arrays for independent interaction faults ⋮ Superpure digraph designs
Cites Work
- A construction for generalized Hadamard matrices GH(4q,EA(q))
- On difference matrices, resolvable transversal designs and generalized Hadamard matrices
- A large index theorem for orthogonal arrays, with bounds
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- A Generalization of a Theorem due to MacNeish
- Orthogonal Arrays of Index Unity
This page was built for publication:
