The following pages link to Extending t-designs (Q1213875):
Displaying 29 items.
- An upper bound of the value of \(t\) of the support \(t\)-designs of extremal binary doubly even self-dual codes (Q264124) (← links)
- A study of orthogonal arrays from the point of view of design theory (Q790120) (← links)
- Design-theoretic analogies between codes, lattices, and vertex operator algebras (Q831164) (← links)
- Large sets of \(t\)-designs through partitionable sets: a survey (Q856838) (← links)
- The existence of simple \(6\text{-}(14,7,4)\) designs (Q1104330) (← links)
- The family of t-designs. Part I (Q1146481) (← links)
- On the mutual embeddability of (2k, k, k-1) and (2k - 1,k,k) quasi- residual designs (Q1149441) (← links)
- Classifications of certain t-designs (Q1236121) (← links)
- On some \(t\)-\((2k,k,\lambda)\) designs (Q1241451) (← links)
- A summary of noncylic difference sets, \(k<20\) (Q1249175) (← links)
- New \(t\)-designs and large sets of \(t\)-designs (Q1292816) (← links)
- Some existence theorems for \(t\)-designs (Q1322195) (← links)
- More on halving the complete designs (Q1343246) (← links)
- All block designs with \(b={v\choose k}/2\) exist (Q1377704) (← links)
- On three-designs of small order (Q1838966) (← links)
- Simple non-trivial designs with an arbitrary automorphism group (Q1865405) (← links)
- A construction of 2-designs from Steiner systems and extendable designs (Q1957982) (← links)
- Some new families of 3-regular self-complementary \(k\)-hypergraphs (Q2152951) (← links)
- A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\) (Q2153749) (← links)
- Simple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\) (Q2467993) (← links)
- A note on the Assmus-Mattson theorem for some binary codes (Q2672304) (← links)
- Constructing regular self-complementary uniform hypergraphs (Q2896012) (← links)
- Classification of 6‐(14,7,4) designs with nontrivial automorphism groups (Q4537565) (← links)
- Some new 6-(14, 7, 4) designs (Q5929838) (← links)
- On the number of mutually disjoint cyclic designs and large sets of designs (Q5935433) (← links)
- Recursive constructions for 3-designs and resolvable 3-designs (Q5954612) (← links)
- Bussey systems and Steiner's tactical problem (Q6146845) (← links)
- The maximum number of columns in E(s2) $\,E({s}^{2})$‐optimal supersaturated designs with 16 rows and smax=4 ${s}_{{\rm{\max }}}=4$ is 60 (Q6187004) (← links)
- On \(\mathrm{E}(s^2)\)-optimal and minimax-optimal supersaturated designs with 20 rows and 76 columns (Q6494506) (← links)
