2-(v,k,1) Designs and PSL (3,q) whereqis ODD
β Scribed by Ding Shifeng
- Book ID
- 107500609
- Publisher
- SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
- Year
- 2003
- Tongue
- English
- Weight
- 380 KB
- Volume
- 18
- Category
- Article
- ISSN
- 1005-1031
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We determine the distribution of 3β(__q__ + 1,__k__,Ξ») designs, with __k__ Ο΅ {4,5}, among the orbits of __k__βelement subsets under the action of PSL(2,__q__), for __q__ Ο΅ 3 (mod 4), on the projective line. As a consequence, we give necessary and sufficient conditions for the existence
Stinson introduced authentication perpendicular arrays APA Ξ» (t, k, v), as a special kind of perpendicular arrays, to construct authentication and secrecy codes. Ge and Zhu introduced APAV(q, k) to study APA1(2, k, v) for k = 5, 7. In this article, we use a theorem on character sums to show that for
For any In, k, d; q]-code the Griesmer bound says that n >t ~ F d/q' 7. The purpose of this paper is to characterize all In, k, qk-1 \_ 3q~; q]-codes meeting the Griesmer bound in the case where k >/3, q >~ 5 and 1 ~</~ < k -1. It is shown that all such codes have a generator matrix whose columns co
Let p be an odd prime number such that p -1 = 2 e m for some odd m and e β₯ 2. In this article, by using the special linear fractional group PSL(2, p), for each i, 1 β€ i β€ e, except particular cases, we construct a 2-design with parameters v = p + 1, k = (p -1)/2 i + 1 and Ξ» = ((p-1)/2 i +1)(p-1)/2 =
An automorphism of a 2-(v, k, 1) design acts as a permutation of the points and as another of the blocks. We show that the permutation of the blocks has at least as many cycles, of lengths n > k, as the permutation of the points. Looking at Steiner triple systems we show that this holds for all n un