scientific article; zbMATH DE number 3166657

Cited in

(47)

Characterization of \(\{(q+1)+2,1;t,q\}-\min \cdot hypers\) and \(\{2(q+1)+2,2;2,q\}-\min \cdot hypers\) in a finite projective geometry
Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes
Characterization of \(\{2(q+1)+2,2;t,q\}\)-\(\min \cdot hypers\) in PG(t,q) (t\(\geq 3,q\geq 5)\) and its applications to error-correcting codes
A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs
Algebraic theory of block codes detecting independent errors
Polynomial representations of complete sets of frequency hyperrectangles with prime power dimensions
A characterization of some \(\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}\)-minihypers and some \((v_ k-30,k,3^{k-1}-21;3)\)-codes meeting the Griesmer bound
On two level symmetrical factorial designs
Lower bounds on \(m_t(r,s)\)
On a geometrical method of construction of maximal t-linearly independent sets
A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry
On the nonexistence of some quaternary linear codes meeting the Griesmer bound
The nonexistence of ternary [79, 6, 51] codes
The packing problem in statistics, coding theory and finite projective spaces
Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
A characterization of some \(\{ 3v_ 2+v_ 3,3v_ 1+v_ 2; 3,3\}\)-minihypers and some \([15,4,9; 3]\)-codes with \(B_ 2=0\)
A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codes
Note on Draper and Lin's article Capacity considerations for two-level fractional factorial designs
Theory of optimal blocking of \(2^{n-m}\) designs
Multistratum fractional factorial split-plot designs with minimum aberration and maximum estimation capacity
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
The packing problem for projective geometries over GF(3) with dimension greater than five
Maximal sets of points in finite projective space, no t-linearly dependent
Generalized minimum aberration for asymmetrical fractional factorial designs
Generalized minimum aberration for asymmetrical fractional factorial designs.
Theory of minimum aberration blocked regular mixed factorial designs
The nonexistence of \([71,5,46;3]\)-codes
Generalized wordtype pattern for nonregular factorial designs with multiple groups of factors
Some general existence conditions for balanced arrays of strength \(t\) and 2 symbols
On maximal t-linearly independent sets
On generalized Hadamard matrices of minimum rank
Orthogonal and partially balanced arrays and their application in design of experiments
Row-column factorial designs with strength at least 2
Two-level screening designs derived from binary nonlinear codes
A family of partial geometric designs from three-class association schemes
Divisibility of polynomials over finite fields and combinatorial applications
Complementary design theory for sliced equidistance designs
Theory of optimal blocking of nonregular factorial designs
Division of tetranomials by type II pentanomials and orthogonal arrays
A scientific tour on orthogonal arrays
An application of information theory and error-correcting codes to fractional factorial experiments
Orthogonal arrays: a review
Fixed-strength spherical designs
On proper secrets, (t,k)-bases and linear codes
Characterization of minimum aberration mixed factorials in terms of consulting designs
An efficient method for identifying clear effects in blocked fractional factorial designs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3285034)