Decoding of codes on hyperelliptic curves (Q4950441)
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 1426185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decoding of codes on hyperelliptic curves |
scientific article; zbMATH DE number 1426185 |
Statements
30 March 2000
0 references
0.8193700909614563
0 references
0.8191272616386414
0 references
0.8184138536453247
0 references
Decoding of codes on hyperelliptic curves (English)
0 references
\textit{R. Pellikaan's} algorithm [ IEEE Trans. Inform. Theory 35, No. 6, 1228-1232 (1989)] applies a number of times in parallel to \textit{A. N. Skorobogatov} and \textit{S. G. Vladut's} basic decoding algorithm [ Trans. Inform. Theory 36, No. 5, 1051-1060 (1990)]. To perform the algorithm, we have to find some integer \(s\) and an \(s\)-uple of divisors and this is not easy in practice except for codes on an elliptic curve. In this paper we answer that question for a particular hyperelliptic curve and point out some properties of the Jacobian which will be useful to solve the problem for any other hyperelliptic curve. For the entire collection see [Zbl 0755.94003].
0 references
