scientific article; zbMATH DE number 3048068
From MaRDI portal
Publication:5787292
zbMath0031.06201MaRDI QIDQ5787292
Publication date: 1947
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Constructions of irredundant orthogonal arrays ⋮ Constructions for new orthogonal arrays based on large sets of orthogonal arrays ⋮ Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning ⋮ Orthogonal mixed models and prime basis factorials ⋮ Some classes of orthogonal \(2^{n_1}\times 3^{n_2}\) mixed factorial designs of median-resolution ⋮ 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\) ⋮ A new mathematical space with applications to statistical experimental design. I: Preliminary results ⋮ On orthogonal arrays of strength 3 and 5 achieving Rao's bound ⋮ A flexible image cipher based on orthogonal arrays ⋮ Further investigations on balanced arrays ⋮ Mixture designs constructed using Taguchi's mixed element orthogonal arrays ⋮ Construction of symmetric orthogonal designs with deep Q-network and orthogonal complementary design ⋮ Uniform semi-Latin squares and their pairwise-variance aberrations ⋮ 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 ⋮ Constructions of 2-resilient rotation symmetric Boolean functions through symbol transformations of cyclic Hadamard matrix ⋮ Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations ⋮ A construction and decomposition of orthogonal arrays with non-prime-power numbers of symbols on the complement of a Baer subplane ⋮ On squashed designs ⋮ Optimal design for interacting blocks with OAVS incidence ⋮ On existence and number of orthogonal arrays ⋮ 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\) ⋮ On orthogonal arrays attaining Rao's bounds ⋮ The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2 ⋮ 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 ⋮ Orthogonal arrays and designs for partial triallel crosses ⋮ Construction of some asymmetrical orthogonal arrays ⋮ On the existence of saturated and nearly saturated asymmetrical orthogonal arrays ⋮ Orthogonal designs of parallel flats type ⋮ Correction to: ``Construction of some \(s\)-level regular designs with general minimum lower-order confounding ⋮ J.N. Srivastava and experimental design ⋮ Orthogonal arrays of strength five ⋮ Simplicity conditions for binary orthogonal arrays ⋮ Consecutive detecting arrays for interaction faults ⋮ Strongly regular graphs having strongly regular subconstituents ⋮ New results for 2-uniform states based on irredundant orthogonal arrays ⋮ \(t\)-resilient functions and the partial exposure problem ⋮ Harmonic index designs in binary Hamming schemes ⋮ Optimal locating arrays for at most two faults ⋮ Orthogonal arrays obtainable as solutions to linear equations over finite fields ⋮ Orthogonal plans of resolution IV and V ⋮ Row-column factorial designs with strength at least 2 ⋮ Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs ⋮ On tight 4-designs in Hamming association schemes ⋮ A characterization of strong orthogonal arrays of strength three ⋮ Small matrices of large dimension ⋮ Defining equations for two-level factorial designs ⋮ Classification of three-level strength-3 arrays ⋮ On the existence of nested orthogonal arrays ⋮ An effective algorithm for generation of factorial designs with generalized minimum aberration ⋮ Uniformity of saturated orthogonal arrays ⋮ Energy bounds for codes and designs in Hamming spaces ⋮ Approximation of bounds on mixed-level orthogonal arrays ⋮ Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals ⋮ Main effect plans with an additional search property for \(2^ m\) factorial experiments ⋮ Hydrodynamic interactions of water waves with a group of independently oscillating truncated circular cylinders ⋮ Complete enumeration of pure-level and mixed-level orthogonal arrays ⋮ Schur- and \(E\)-optimal two-level factorial designs ⋮ Efficient designs based on orthogonal arrays of type I and type II for experiments using units ordered over time or space ⋮ Hyper-rook Domain Inequalities ⋮ Efficient block designs for comparing test treatments to a control when the errors are correlated ⋮ Some new orthogonal arrays \(\mathrm{OA}(4r,r^{1}2^{p},2)\) ⋮ Recent developments in nonregular fractional factorial designs ⋮ On two level symmetrical factorial designs ⋮ Rotation designs for experiments in high-bias situations ⋮ Efficient block designs for comparing test treatments to a control when the errors are correlated ⋮ Association schemes and t-designs in regular semilattices ⋮ A note on the price of bandit feedback for mistake-bounded online learning ⋮ Nearest neighbor balanced block designs for autoregressive errors ⋮ Partially replicated block designs for two-level factorial experiments ⋮ On proper secrets, \((t,k)\)-bases and linear codes ⋮ New bounds on the price of bandit feedback for mistake-bounded online multiclass learning ⋮ Bilinear forms over a finite field, with applications to coding theory ⋮ 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] ⋮ Capacity considerations for two-level fractional factorial designs ⋮ Special feature: Information theory and statistics ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays ⋮ Orthogonal arrays, primitive trinomials, and shift-register sequences ⋮ Cyclic generators for saturated orthogonal arrays ⋮ Characterization of triply balanced matrices with applications to survey sampling ⋮ Almost \(k\)-wise independence versus \(k\)-wise independence ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols ⋮ Optimal designs for stated choice experiments generated from fractional factorial designs ⋮ Supersaturated designs for asymmetrical factorial experiments ⋮ Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications ⋮ The packing problem for projective geometries over GF(3) with dimension greater than five ⋮ On arrays with some combinatorial structure ⋮ On designs in compact metric spaces and a universal bound on their size ⋮ 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
This page was built for publication:
