## Abstract We determine the distribution of 3โdesigns among the orbits of 4โ and 5โelement subsets under the action of PSL(2,2^__n__^) on the projective line. Thus we give complete information on all KramerโMesner matrices for the action of PSL(2,2^__n__^) on 3โsets versus 4โ and 5โsets. As a cons
Simple 3-designs of PSL(2, 2n) with block size 7
โ Scribed by Weixia Li; Hao Shen
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 156 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
โฆ Synopsis
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 PSL(2, 2^n^) as an automorphism group. ยฉ 2007 Wiley Periodicals, Inc. J Combin Designs 16: 1โ17, 2008
๐ SIMILAR VOLUMES
## 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
## Abstract The necessary conditions for the existence of a superโsimple resolvable balanced incomplete block design on __v__ points with block size __k__ = 4 and index ฮป = 2, are that __v__โโฅโ16 and $v \equiv 4\; (\bmod\; {12})$. These conditions are shown to be sufficient. ยฉ 2006 Wiley Periodical
## Abstract The necessary conditions for the existence of a superโsimple resolvable balanced incomplete block design on __v__ points with __k__โ=โ4 and ฮปโ=โ3, are that __v__โโฅโ8 and __v__โโกโ0โmodโ4. These conditions are shown to be sufficient except for __v__โ=โ12. ยฉ 2003 Wiley Periodicals, Inc.
## Abstract Large sets of disjoint groupโdivisible designs with block size three and type 2^__n__^4^1^ have been studied by Schellenberg, Chen, Lindner and Stinson. These large sets have applications in cryptography in the construction of perfect threshold schemes. It is known that such large sets