No label defined (Q3754567)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4002031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4002031 |
Statements
1986
0 references
algebraic number fields
0 references
curves over a finite field
0 references
geometry of numbers
0 references
archimedean valuations
0 references
asymptotic properties
0 references
Gilbert-Varshamov bound
0 references
Generalized Riemann Hypothesis
0 references
infinite class field tower
0 references
0.8608450293540955
0 references
0.8571377396583557
0 references
0.8383840918540955
0 references
0.8324262499809265
0 references
[For the entire collection see Zbl 0596.00003.] Several years ago, Goppa and Tsfasman used curves over finite fields to produce a new class of algebraic codes, with particularly striking asymptotic properties [see \textit{M. A. Tsfasman}, \textit{S. G. Vlădut} and \textit{Th. Zink}, Math. Nachr. 109, 21-28 (1982; Zbl 0574.94013)]. In particular, these codes beat the Gilbert-Varshamov bound. In the present paper the well-known analogy between algebraic number fields and curves over a finite field is exploited to construct a similar class of codes with the help of algebraic number fields. The use of the Riemann-Roch theorem is then replaced by considerations from the geometry of numbers. The presence of archimedean valuations poses some problems. First, it causes the new codes to be non-linear. Secondly, it leads to a non- constructive element in the description of the codes so that the question of finding encoding and decoding algorithms - already difficult for the codes of Goppa and Tsfasman - cannot yet be addressed. The asymptotic properties of this new class of codes are also investigated. The results obtained are rather weak: the codes obtained cannot be better than Plotkin's upper bound, which is obvious, but they are at least as good, roughly speaking, as the codes that the Gilbert- Varshamov bound predicts to exist. Better results are obtained if the Generalized Riemann Hypothesis is assumed, which is, after all, available in the case of algebraic curves over a finite field. With this assumption, the new codes cannot be as good asymptotically as those of Goppa and Tsfasman, but they are better than the Gilbert-Varshamov codes. The proof of the first statement depends on Weil's explicit formulae in the theory of prime numbers, and the proof of the second statement on the construction of a special infinite class field tower. How good exactly the new codes are is an open problem, even when the truth of the Generalized Riemann Hypothesis is assumed.
0 references