Coding-theoretical methods are used to obtain improved lower bounds for character sums induced by a multiplicative character of an arbitrary order over GF(q).
Equidistant Arithmetic Codes and Character Sums
โ Scribed by D.M. Gordon
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 329 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
โฆ Synopsis
A cyclic arithmetic code is a subgroup of (\mathbf{Z} /\left(r^{n}-1\right) \mathbf{Z}), where the weight of a word (x) is the minimal number of nonzero coefficients in the representation (x \equiv \sum_{i=0}^{n-1} c_{i} r^{i}) with (\left|c_{i}\right|<r) for all (i). A code is called equidistant if all nonzero codewords have the same weight. In this paper necessary conditions for the existence of equidistant codes are given. By relating these conditions to character sums on certain intervals, it is shown that for (r=2,3) no new equidistant codes exist, and several infinite families of equidistant codes are given. 1994 Academic Press. Inc.
๐ SIMILAR VOLUMES
In this paper we develop an ideal theory for certain submonoids of the nonzero integers. We associate one of these monoids to each quadratic number field and show that the genus theory of ideals and genus characters of the number field are virtually the same as the ideal theory and the characters of
Consider an extension field F q m =F q (a) of the finite field F q . Davenport proved that the set F q +a contains at least one primitive element of F q m if q is sufficiently large with respect to m. This result is extended to certain subsets of F q +a of cardinality at least of the order of magnit