Decoding of codes on hyperelliptic curves

From MaRDI portal





\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].











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)