Decoding of codes on hyperelliptic curves
\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].
- Hyperelliptic function fields and codes
- The theta divisor of a Jacobian variety and the decoding of geometric Goppa codes
- Decidability of involution hypercodes
- On the gonality of curves, abundant codes and decoding
- scientific article; zbMATH DE number 1294398 (Why is no real title available?)
- scientific article; zbMATH DE number 493109 (Why is no real title available?)
- Fast decoding of codes from algebraic curves
- Guruswami-Sudan Decoding of Elliptic Codes Through Module Basis Reduction
- On the generating matrices of Goppa codes over hyperelliptic curves
- Mumford representation and Riemann-Roch space of a divisor on a hyperelliptic curve
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
This page was built for publication: Decoding of codes on hyperelliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4950441)