We present here a combinatorial approach to special divisors and secant divisors on curves over finite fields based on their relations with error-correcting codes. Applying to linear systems on curves over finite fields numerous coding theory bounds one gets a lot of bounds on their dimensions. This
Sumsets in Vector Spaces over Finite Fields
β Scribed by Shalom Eliahou; Michel Kervaire
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 436 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
If F is the finite field of characteristic p and order q s p , let F F q be the q category whose objects are functors from finite dimensional F -vector spaces to q F -vector spaces, and with morphisms the natural transformations between such q functors. Ε½ . A fundamental object in F F q is the injec
We study the geometrical properties of the subgroups of the mutliplicative group of a "nite extension of a "nite "eld endowed with its vector space structure and we show that in some cases the associated projective space has a natural group structure. We construct some cyclic codes related to Reed}M
Let GF(q) be the Galois field of order q"pF, and let m53 be an integer. An explicit formula for the number of GF(qK)-rational points of the Fermat curve XL#Β½L#ZL"0 is given when n divides (qK!1)/(q!1) and p is sufficiently large with respect to (qK!1)/(n(q!1)).
## Abstract We consider twoβsorted theories of vector spaces and prove a criterion for the assertion that such a theory allows elimination of quantifiers over vector variables.