The following pages link to (Q5796828):
Displaying 50 items.
- Transitive hyperovals (Q281326) (← links)
- Some new two-weight ternary and quinary codes of lengths six and twelve (Q340177) (← links)
- Partitions of \(\mathrm{AG}(4, 3)\) into maximal caps (Q465267) (← links)
- Sudoku-like arrays, codes and orthogonality (Q510424) (← links)
- Conics and caps (Q657009) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- On proper secrets, \((t,k)\)-bases and linear codes (Q735016) (← links)
- New \((n, r)\)-arcs in \(\mathrm{PG}(2, 17)\), \(\mathrm{PG}(2, 19)\), and \(\mathrm{PG}(2, 23)\) (Q764397) (← links)
- Sulle \(k\)-calotte di uno spazio lineare finito (Q768169) (← links)
- On the uniqueness of \((q+1)_ 4\)-arcs of \(PG(4,q),q=2^ h,h\vee\) (Q791151) (← links)
- Complex linear models and cyclic designs (Q809521) (← links)
- Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs (Q868334) (← links)
- \(2^m4^1\) designs with minimum aberration or weak minimum aberration (Q882895) (← links)
- Orthogonal arrays obtainable as solutions to linear equations over finite fields (Q913803) (← links)
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions (Q976161) (← links)
- Maximal caps in \(\mathrm{AG}(6,3)\). (Q1008982) (← links)
- A characterization of quadrics by intersection numbers (Q1009004) (← links)
- On the equivalence of definitions for regular fractions of mixed-level factorial designs (Q1015884) (← links)
- Existence and construction of randomization defining contrast subspaces for regular factorial designs (Q1043754) (← links)
- Factorial design and Abelian groups (Q1071450) (← links)
- Construction d'orthogonaux dans les groupes abéliens finis et confusions d'effets dans les plans factoriels (Q1071453) (← links)
- Confounding in relation to duality of finite Abelian groups (Q1071454) (← links)
- Some new factor screening designs using the search linear model (Q1073514) (← links)
- Colouring finite incidence structures (Q1091607) (← links)
- On a set of lines of \(PG(3,q)\) corresponding to a maximal cap contained in the Klein quadric of \(PG(5,q)\). (Q1103190) (← links)
- A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs (Q1124584) (← links)
- t-designs associated with non degenerate conics in a Galois plane of odd order (Q1134767) (← links)
- On robustness of optimal balanced resolution V plans (Q1150979) (← links)
- Archi completi di ordine (q+3)/2 nei piani di Galois, S(2,9) con q=3 (mod. 4) (Q1162696) (← links)
- On some new search designs for \(2^ m\) factorial experiments (Q1164943) (← links)
- On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound (Q1200291) (← links)
- Polynomial representations of complete sets of frequency hyperrectangles with prime power dimensions (Q1208039) (← links)
- 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 (Q1209669) (← links)
- Ovals in Desarguesian planes of even order (Q1212262) (← links)
- On maximal (k,t)-sets (Q1219131) (← links)
- On two level symmetrical factorial designs (Q1223916) (← links)
- Some new series of PBIB designs and their applications (Q1231365) (← links)
- Some higher class PBIB designs and their application as confounded factorial experiments (Q1233281) (← links)
- On complexes of abelian groups with applications to fractional factorial designs (Q1241593) (← links)
- Some filing schemes based on finite groups of automorphisms (Q1245580) (← links)
- Lower bounds on \(m_t(r,s)\) (Q1250614) (← links)
- On a geometrical method of construction of maximal t-linearly independent sets (Q1250821) (← links)
- Caps and codes (Q1251393) (← links)
- On the construction of factorial designs using Abelian group theory (Q1258150) (← links)
- On arcs with weighted points (Q1258747) (← links)
- 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 (Q1262869) (← links)
- On the spectrum of the values \(k\) for which a complete \(k\)-cap in \(PG(n,q)\) exists (Q1266486) (← links)
- \(2^{n-m}\) designs with resolution III or IV containing clear two-factor interactions (Q1299016) (← links)
- Aliasing in \(2^{n-k}\) fractions in the case of a separation of factors (Q1299041) (← links)
- A class of multi-factor designs for test versus control comparisons (Q1299053) (← links)
