Publication:5787292
From MaRDI portal
zbMath0031.06201MaRDI QIDQ5787292
Publication date: 1947
Related Items
Orthogonal arrays of strength five, Efficient block designs for comparing test treatments to a control when the errors are correlated, Rotation designs for experiments in high-bias situations, Efficient block designs for comparing test treatments to a control when the errors are correlated, Some classes of orthogonal \(2^{n_1}\times 3^{n_2}\) mixed factorial designs of median-resolution, Main effect plans with an additional search property for \(2^ m\) factorial experiments, Orthogonal arrays obtainable as solutions to linear equations over finite fields, On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\), On orthogonal arrays of strength 3 and 5 achieving Rao's bound, On squashed designs, On existence and number of orthogonal arrays, On orthogonal arrays attaining Rao's bounds, Strongly regular graphs having strongly regular subconstituents, Small matrices of large dimension, On two level symmetrical factorial designs, Association schemes and t-designs in regular semilattices, Bilinear forms over a finite field, with applications to coding theory, Capacity considerations for two-level fractional factorial designs, Orthogonal arrays, primitive trinomials, and shift-register sequences, Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications, Aliasing in \(2^{n-k}\) fractions in the case of a separation of factors, On balanced orthogonal multi-arrays: Existence, construction and application to design of experiments, On existence of two symbol complete orthogonal arrays, A new mathematical space with applications to statistical experimental design. I: Preliminary results, Optimal design for interacting blocks with OAVS incidence, On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2, Construction of orthogonal arrays, A linear programming bound for orthogonal arrays with mixed levels, On difference schemes and orthogonal arrays of strength \(t\), Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs, On designs in compact metric spaces and a universal bound on their size, On finding mixed orthogonal arrays of strength 2 with many 2-level factors, Fractional factorial designs of two and three levels, A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry], A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound], Characterization of triply balanced matrices with applications to survey sampling, The packing problem for projective geometries over GF(3) with dimension greater than five, On arrays with some combinatorial structure, Optimal design with many blocking factors., A brief biography and appreciation of Calyampudi Radhakrishna Rao, with a bibliography of his books and papers, On nonorthogonality and nonoptimality of Addelman's main-effect plans satisfying the condition of proportional frequencies, Mixed difference matrices and the construction of orthogonal arrays, A survey of orthogonal arrays of strength two, Construction of some asymmetrical orthogonal arrays, On the existence of saturated and nearly saturated asymmetrical orthogonal arrays, Orthogonal designs of parallel flats type, Further investigations on balanced arrays, An effective algorithm for generation of factorial designs with generalized minimum aberration, Efficient designs based on orthogonal arrays of type I and type II for experiments using units ordered over time or space, Some new orthogonal arrays \(\mathrm{OA}(4r,r^{1}2^{p},2)\), Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols, Determinantenabschätzungen für binäre Matrizen. (Estimation of determinants for binary matrices), Orthogonal and partially balanced arrays and their application in design of experiments, Hyper-rook Domain Inequalities
