✦ LIBER ✦

Two infinite families of failed symmetric designs

✍ Scribed by Marialuisa J. de Resmini; Dieter Jungnickel

Book ID: 108315782
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 97 KB
Volume: 261
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00470-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular Hadamard Matrices Generating Inf

Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs

✍ Yury J. Ionin 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 107 KB

An infinite family of symmetric designs

✍ Christopher J. Mitchell 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 363 KB

In this paper, using the construction method of [3], we show that if q > 2 is a prime power such that there exists an afhne plane of order q -1, then there exists a strongly divisible 2 -((q -l)(qh -l), qh-'(q -l), qh-') design for every h 2 2. We show that these quasi-residual designs are embeddabl

Two new infinite families of extremal cl

Two new infinite families of extremal class-uniformly resolvable designs

✍ J.H. Dinitz; Alan C.H. Ling 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views

## Abstract In 1991, Lamken et al. [7] introduced the notion of class‐uniformly resolvable designs, CURDs. These are resolvable pairwise balanced designs PBD(__v__, __K__, λ) in which given any two resolution classes __C__ and __C__', for each __k__ ∈ __K__ the number of blocks of size __k__ in __C

New infinite families of simple 5-design

New infinite families of simple 5-designs

✍ Spyros S Magliveras; Thane E Plambeck 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 272 KB

Two New Infinite Families of 3-Designs f

Two New Infinite Families of 3-Designs from Kerdock Codes over Z4

✍ Kyeongcheol Yang; Tor Helleseth 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 118 KB

Some Infinite Families of Large Sets of

Some Infinite Families of Large Sets of t-Designs

✍ B. Tayfeh-Rezaie 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 98 KB

A set of necessary conditions for the existence of a large set of t-designs, LS[N] (t, k, v), is N |( v&i k&i ) for i=0, 1, ..., t. We show that these conditions are sufficient for N=3, t=2, 3, or 4, and k 8.