𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Designs with Block Size 7

✍ Scribed by Zvonimir Janko; Vladimir D Tonchev


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
148 KB
Volume
83
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis


An imprimitive permutation group of order 4200 is used for the construction of a 2-(175, 7, 1) design. The design yields also a group divisible design 7&GDD and a generalized Bhaskar Rao design GBRD(25, 100, 28, 7, 7; Z 7 ).


πŸ“œ SIMILAR VOLUMES


Balanced incomplete block designs with b
✍ R. Julian R. Abel; Iliya Bluskov; Malcolm Greig πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 257 KB

## Abstract The necessary conditions for the existence of a balanced incomplete block design on υ β‰₯ __k__ points, with index Ξ» and block size __k__, are that: For __k__ = 8, these conditions are known to be sufficient when λ = 1, with 38 possible exceptions, the largest of which is υ = 3,753. For

Some new BIBDs with block size 7
✍ R. Julian R. Abel πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 83 KB

For k ! 3 the existence problem forvY 7Y k BIBDs has been completely solved, except when v 253. In this paper, 3 new direct vY 7Y k BIBD constructions are given for vY k 259Y 1Y 106Y 2Y and 253Y 2. Some features of the known 175Y 7Y 1 BIBD are also discussed. Finally, a few vY 7Y 1 BIBDs are obtaine

Simple 3-designs of PSL(2, 2n) with bloc
✍ Weixia Li; Hao Shen πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 156 KB πŸ‘ 1 views

## Abstract In this paper, we determine the number of the orbits of 7‐subsets of $X= {\rm GF}(2^n)\cup\{\infty\}$ with a fixed orbit length under the action of PSL(2, 2^__n__^). As a consequence, we determine the distribution of Ξ» for which there exists a simple 3‐(2^__n__^ + 1, 7, Ξ») design with P

Incomplete perfect mendelsohn designs wi
✍ F. E. Bennett; H. Shen; J. Yin πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 676 KB

## Abstract Let __v,k__, and __n__ be positive integers. An incomplete perfect Mendelsohn design, denoted by __k__‐IPMD__(v,n)__, is a triple (__X, Y__, 𝔹) where __X__ is a __v__‐set (of points), __Y__ is an __n__‐subset of __X__, and 𝔹 is a collection of cyclically ordered __k__‐subsets of __X__ (

Splitting balanced incomplete block desi
✍ Beiliang Du πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 149 KB

## Abstract Splitting balanced incomplete block designs were first formulated by Ogata, Kurosawa, Stinson, and Saido recently in the investigation of authentication codes. This article investigates the existence of splitting balanced incomplete block designs, i.e., (__v__, 3__k__, Ξ»)‐splitting BIBD