The following pages link to Orthogonal Arrays of Index Unity (Q5812203):
Displaying 50 items.
- Optimum detecting arrays for independent interaction faults (Q255973) (← links)
- On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
- A characterization of MDS codes that have an error correcting pair (Q285480) (← links)
- Resolvable generalized difference matrices: existence and applications (Q324263) (← links)
- Observability of lattice graphs (Q329291) (← links)
- An approach of constructing mixed-level orthogonal arrays of strength \(\geqslant 3\) (Q365865) (← links)
- Improved bounds for separating hash families (Q369437) (← links)
- Multimagic rectangles based on large sets of orthogonal arrays (Q385738) (← links)
- A construction for \(t\)-fold perfect authentication codes with arbitration (Q404930) (← links)
- Constructing heterogeneous hash families by puncturing linear transversal designs (Q408964) (← links)
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II (Q438886) (← links)
- Completely reducible super-simple designs with block size five and index two (Q494593) (← links)
- A two-stage algorithm for combinatorial testing (Q519759) (← links)
- Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) (Q520418) (← links)
- A trigonometric approach to quaternary code designs with application to one-eighth and one-sixteenth fractions (Q548540) (← links)
- On the existence of orthogonal arrays OA\((3,5,4n+2)\) (Q616457) (← links)
- The equivalence between optimal detecting arrays and super-simple OAs (Q663478) (← links)
- Almost MDS codes (Q679427) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- Inclusion matrices and the MDS conjecture (Q727207) (← links)
- On proper secrets, \((t,k)\)-bases and linear codes (Q735016) (← links)
- A study of orthogonal arrays from the point of view of design theory (Q790120) (← links)
- Constructing new covering arrays from LFSR sequences over finite fields (Q897312) (← links)
- Finite field constructions of combinatorial arrays (Q908047) (← links)
- On the construction of \(q\)-ary equidistant codes (Q941879) (← links)
- Constructions of new orthogonal arrays and covering arrays of strength three (Q965209) (← links)
- Optimal and near-optimal mixed covering arrays by column expansion (Q998340) (← links)
- On some optimal fractional \(2^ m \)factorial designs of resolution V (Q1052783) (← links)
- On the nonexistence of certain M.D.S. codes and projective planes (Q1059615) (← links)
- On incomplete orthogonal arrays (Q1068090) (← links)
- On orthogonal arrays of strength 3 and 5 achieving Rao's bound (Q1080855) (← links)
- Some distribution numbers of the hypercubic association scheme (Q1103622) (← links)
- On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre (Q1109009) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- Small matrices of large dimension (Q1174691) (← links)
- On maximal (k,t)-sets (Q1219131) (← links)
- Correction note otto 'On maximal (k,t)-sets' (Q1219132) (← links)
- On two level symmetrical factorial designs (Q1223916) (← links)
- Application of orthogonal arrays and MARS to inventory forecasting stochastic dynamic programs. (Q1285809) (← links)
- The packing problem in statistics, coding theory and finite projective spaces (Q1299059) (← links)
- Some new 2-resolvable Steiner quadruple systems (Q1321552) (← links)
- A construction for orthogonal arrays with strength \(t\geq 3\) (Q1343774) (← links)
- Cyclic orthogonal and balanced arrays (Q1361711) (← links)
- On difference schemes and orthogonal arrays of strength \(t\) (Q1361728) (← links)
- Construction of asymmetric orthogonal arrays through finite geometries. (Q1399283) (← links)
- The existence theorem for group divisible designs of large order (Q1601428) (← links)
- Ideal ramp schemes and augmented orthogonal arrays (Q1625799) (← 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)
- Permanents of d-dimensional matrices (Q1820218) (← links)
