Decoding of codes on the Klein Quartic
暂无分享,去创建一个
Following R. Pellikaan who gave, in 1989, an algorithm which decodes geometric codes up to \(t^* = \left[ {\frac{{d^* - 1}}{2}} \right]\) errors where d* is the designed distance of the code, we describe an effective decoding procedure for some geometric codes on the Klein quartic.
[1] Serge G. Vladut,et al. On the decoding of algebraic-geometric codes over Fq for q>=16 , 1990, IEEE Trans. Inf. Theory.
[2] José Felipe Voloch,et al. A formula for the Cartier operator on plane algebraic curves. , 1987 .
[3] V. D. Goppa. Geometry and Codes , 1988 .
[4] Ruud Pellikaan,et al. On a decoding algorithm for codes on maximal curves , 1989, IEEE Trans. Inf. Theory.
[5] A.N. Skorobogatov,et al. On the decoding of algebraic-geometric codes , 1990, IEEE Trans. Inf. Theory.