On the Characters of the Maximal Subgroup Sp4(q)of the Symplectic GroupSp4(q),q-Even
✍ Scribed by M. I. Alali; C. H. Hering; J. Schäeffer
- Publisher
- Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2001
- Tongue
- English
- Weight
- 197 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1439-7617
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
It is unknown whether or not there exists an [87, 5, 57 ; 31-code. Such a code would meet the Griesmer bound. The purpose of this paper is to give a constructive proof of the existence of [q4 + q2 \_ q, 5, q'\* -q3 + q2 \_ 2q; q]-codes for any prime power q \_> 3. As a special case, it is shown that
## Abstract We characterize the smallest minimal blocking sets of Q(6,__q__), __q__ even and __q__ ≥ 32. We obtain this result using projection arguments which translate the problem into problems concerning blocking sets of Q(4,__q__). Then using results on the size of the smallest minimal blocking
Two results are proved: (1) In PG(3, q), q=2 h, h>~3, every q3-arc can be uniquely completed to a (q + 1)3-arc. (2) In PG(4, q), q = 2", h ~> 3, every (q + 1)4-arc is a normal rational curve. ## 1. In~oduction We assume throughout this paper that the base field GF(q) is of order q = 2 h, where h i