We study a combinatorial problem for vector spaces over finite fields which generalizes the following classical problem in algebraic coding theory: given a finite field Fq and integers n > k 2 1, find the largest minimum distance that can be achieved by a linear code over Fq with fixed length n and
A generalization of Gaussian sums to vector spaces over finite fields
โ Scribed by Priscilla S. Bremser
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 425 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let < be a "nite additive subgroup of a "eld K of characteristic p'0. We consider sums of the form S F (< : )" TZ4 (v# )F for h50 and 3 K. In particular, we give necessary and su$cient conditions for the vanishing of S F (<; ), in terms of the digit sum in the base-p expansion of h, in the case that
Evaluation of some exponential sums over i l finite field By L. CAF~LITZ of Durham (U.S.A.) (Eingegangen am 10.7.1978) 1. Introduction. Let Fq = QF(q) denote the finite field of order q = p", p prime, n 2 1. For a E Fq put t(a) = a + up + + up"-' and e(a) = p i W / p , so that t(aP) = t(a), e(aP) =
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
In this article we investigate the location of the null sets of generalized ลฝ . pseudo-derivatives of the product or quotient of abstract polynomials. Some special cases of this general problem were studied by Walsh as geometry of polynomials in the complex plane. One of our two results deduces an i