scientific article; zbMATH DE number 3057679
From MaRDI portal
Publication:5796828
Cited in
(only showing first 100 items - show all)- EFFICIENCY FACTORS FOR LINEAR CONTRASTS IN CONFOUNDED ASYMMETRICAL FACTORIAL DESIGNS
- Factorial designs robust against the presence of an aberration
- Classification of spreads of Tits quadrangles of order 64
- On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound
- Rerandomization in 2K factorial experiments
- 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
- Isomorphism check for \(2^n\) factorial designs with randomization restrictions
- On the uniqueness of \((q+1)_ 4\)-arcs of \(PG(4,q),q=2^ h,h\vee\)
- 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
- 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
- Multi-part balanced incomplete-block designs
- Nearly resolution V plans on blocks of small size
- Sudoku-like arrays, codes and orthogonality
- Automatic generation of generalised regular factorial designs
- Embedding the complement of an oval in a projective plane of even order
- On designs in compact metric spaces and a universal bound on their size
- On maximal (k,t)-sets
- On two level symmetrical factorial designs
- The extensible no-three-in-line problem
- Some new series of PBIB designs and their applications
- On complexes of abelian groups with applications to fractional factorial designs
- Algebraic generation of minimum size orthogonal fractional factorial designs: an approach based on integer linear programming
- On \(k\)-caps in \(\mathrm{PG}(n, q)\), with \(q\) even and \(n \geq 3\)
- New applications of the polynomial method: the cap set conjecture and beyond
- A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs
- \(2^{n-m}\) designs with resolution III or IV containing clear two-factor interactions
- Ovals in \({\mathbb{Z}}^2_{2p} \)
- Construction d'orthogonaux dans les groupes abéliens finis et confusions d'effets dans les plans factoriels
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- Ovoids in \(\text{PG}(3,q)\): A survey
- Colouring finite incidence structures
- Exponentially larger affine and projective caps
- On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
- Some higher class PBIB designs and their application as confounded factorial experiments
- Factorial design and Abelian groups
- Some filing schemes based on finite groups of automorphisms
- Clear two-factor interactions and minimum aberration
- Suzuki-Tits ovoids through the years
- The subfield codes of hyperoval and conic codes
- Some new factor screening designs using the search linear model
- New large \((n, r)\)-arcs in \(\mathrm{PG}(2, q)\)
- On a set of lines of \(PG(3,q)\) corresponding to a maximal cap contained in the Klein quadric of \(PG(5,q)\).
- Harmonic ovals
- Maximum flag-rank distance codes
- Planar arcs
- On the construction of factorial designs using Abelian group theory
- On pancyclic representable matroids
- Complex linear models and cyclic designs
- On some new search designs for \(2^ m\) factorial experiments
- Multistage design procedures for identifying two-factor interactions, when higher effects are negligible
- Bounds on \((n,r)\)-arcs and their application to linear codes
- A characterization of quadrics by intersection numbers
- Archi completi di ordine (q+3)/2 nei piani di Galois, S(2,9) con q=3 (mod. 4)
- A class of multi-factor designs for test versus control comparisons
- Covering and radius-covering arrays: constructions and classification
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
- Efficiency factors for natural contrasts in partially confounded factorial designs
- Transitive hyperovals
- Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs
- Maximal sets of points in finite projective space, no t-linearly dependent
- The connected graphs obtained from finite projective planes
- Orthogonal arrays of strength five
- On maximal \(t\)-linearly independent sets
- General balance and treatment permutations
- Detailed wordlength pattern of regular fractional factorial split-plot designs in terms of complementary sets
- Near-factorial experiments in nested row-column designs regulating efficiencies
- t-designs associated with non degenerate conics in a Galois plane of odd order
- On the spectrum of the values \(k\) for which a complete \(k\)-cap in \(PG(n,q)\) exists
- The packing problem in statistics, coding theory and finite projective spaces
- Orthogonal designs of parallel flats type
- Regular fractional factorial designs with minimum aberration and maximum estimation capacity
- The packing problem for projective geometries over GF(3) with dimension greater than five
- Structure function for aliasing patterns in \(2^{l-n}\) design with multiple groups of factors
- Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
- Ovals in Desarguesian planes of even order
- A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound
- Improved bounds on \(m_r(2,q)q=19,25,27\)
- Lower bounds on \(m_t(r,s)\)
- \(2^{n-l}\) designs with weak minimum aberration
- The spectrum of the information matrix for \(s^ n\) parallel flats fractions when \(s\) is prime
- Aliasing in \(2^{n-k}\) fractions in the case of a separation of factors
- Orthogonal factorial design of parallel flats type and its application in biomedical research
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
- On a geometrical method of construction of maximal t-linearly independent sets
- On proper secrets, (t,k)-bases and linear codes
- Existence and construction of randomization defining contrast subspaces for regular factorial designs
- On nonorthogonality and nonoptimality of Addelman's main-effect plans satisfying the condition of proportional frequencies
- On the equivalence of definitions for regular fractions of mixed-level factorial designs
- Conics and caps
- On aliasing and generalized defining relationships of factorial arrangements
- Some economic partially balanced \(2^ m\) factorial fractions
- \(s^{n-m}\) designs containing clear main effects or clear two-factor interactions
- On arcs with weighted points
- On \(k\)-caps in \(\mathrm{PG}(n, q)\), with \(q\) even and \(n \geq 4\)
- Partitions of \(\mathrm{AG}(4, 3)\) into maximal caps
- Chordal matroids arising from generalized parallel connections
- Maximal three-independent subsets of \(\{0,1,2\}^ n\)
- An approach for studying aliasing relations of mixed fractional factorials based on product arrays
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 Q5796828)