The following pages link to (Q5787292):
Displayed 50 items.
- A construction and decomposition of orthogonal arrays with non-prime-power numbers of symbols on the complement of a Baer subplane (Q310234) (← links)
- J.N. Srivastava and experimental design (Q389405) (← links)
- Optimal locating arrays for at most two faults (Q424251) (← links)
- A characterization of strong orthogonal arrays of strength three (Q464184) (← links)
- Energy bounds for codes and designs in Hamming spaces (Q510492) (← links)
- Hydrodynamic interactions of water waves with a group of independently oscillating truncated circular cylinders (Q529329) (← links)
- Classification of three-level strength-3 arrays (Q665028) (← links)
- Main effect plans with an additional search property for \(2^ m\) factorial experiments (Q689409) (← links)
- On proper secrets, \((t,k)\)-bases and linear codes (Q735016) (← links)
- Mixture designs constructed using Taguchi's mixed element orthogonal arrays (Q828503) (← links)
- Uniform semi-Latin squares and their pairwise-variance aberrations (Q830735) (← links)
- Orthogonal arrays obtainable as solutions to linear equations over finite fields (Q913803) (← links)
- Defining equations for two-level factorial designs (Q935447) (← links)
- On the existence of nested orthogonal arrays (Q942093) (← links)
- Recent developments in nonregular fractional factorial designs (Q975573) (← links)
- An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays (Q1023902) (← links)
- Almost \(k\)-wise independence versus \(k\)-wise independence (Q1028993) (← links)
- 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\) (Q1078149) (← links)
- On orthogonal arrays of strength 3 and 5 achieving Rao's bound (Q1080855) (← links)
- On squashed designs (Q1097892) (← links)
- On existence and number of orthogonal arrays (Q1105609) (← links)
- On orthogonal arrays attaining Rao's bounds (Q1109038) (← links)
- Strongly regular graphs having strongly regular subconstituents (Q1144588) (← links)
- Small matrices of large dimension (Q1174691) (← links)
- On two level symmetrical factorial designs (Q1223916) (← links)
- Association schemes and t-designs in regular semilattices (Q1231917) (← links)
- Bilinear forms over a finite field, with applications to coding theory (Q1254279) (← links)
- Capacity considerations for two-level fractional factorial designs (Q1262057) (← links)
- Orthogonal arrays, primitive trinomials, and shift-register sequences (Q1273727) (← links)
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications (Q1292857) (← links)
- Aliasing in \(2^{n-k}\) fractions in the case of a separation of factors (Q1299041) (← links)
- On balanced orthogonal multi-arrays: Existence, construction and application to design of experiments (Q1299081) (← links)
- On existence of two symbol complete orthogonal arrays (Q1323840) (← links)
- A new mathematical space with applications to statistical experimental design. I: Preliminary results (Q1330224) (← links)
- Optimal design for interacting blocks with OAVS incidence (Q1359950) (← links)
- On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2 (Q1361657) (← links)
- Construction of orthogonal arrays (Q1361699) (← links)
- A linear programming bound for orthogonal arrays with mixed levels (Q1361727) (← links)
- On difference schemes and orthogonal arrays of strength \(t\) (Q1361728) (← links)
- Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs (Q1417819) (← links)
- On designs in compact metric spaces and a universal bound on their size (Q1584452) (← links)
- On finding mixed orthogonal arrays of strength 2 with many 2-level factors (Q1593726) (← links)
- Harmonic index designs in binary Hamming schemes (Q1696524) (← links)
- Fractional factorial designs of two and three levels (Q1802129) (← links)
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (Q1802134) (← links)
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound (Q1802135) (← links)
- Characterization of triply balanced matrices with applications to survey sampling (Q1820524) (← links)
- The packing problem for projective geometries over GF(3) with dimension greater than five (Q1839443) (← links)
- On arrays with some combinatorial structure (Q1842160) (← links)
- Optimal design with many blocking factors. (Q1848788) (← links)