Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
V.D. Goppa. "Geometry and Codes", Mathematics and its applications, soviet Series 24. Kluwer Ac Publ. Dordrecht, The Netherlands, 1989.
R. Pellikaan: "On a decoding algorithm for codes on maximal curves". IEEE Trans Inf Theory, Vol. 35, No 6, 1989.
A.N. Skorobogatov, S.G. Vladut: "On the decoding of algebraic — Geometric Codes", IEEE Trans Inf Theory, Vol. 36, 5 (Sept. 1990), 1051–1060.
K.O. Stöhr, J.F. Voloch. "A formula for the Cartier operator on plane algebraic curves". J. Reine Angew Math, 377, 49–64, 1987.
S.G. Vladut: "On the decoding of algebraic geometric does over F q for q≥16". IEEE Trans Inf Theory, Vol. 36, 6 (Nov. 1990), 1461–1463.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rotillon, D., Thiongly, J.A. (1991). Decoding of codes on the klein quartic. In: Cohen, G., Charpin, P. (eds) EUROCODE '90. EUROCODE 1990. Lecture Notes in Computer Science, vol 514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54303-1_126
Download citation
DOI: https://doi.org/10.1007/3-540-54303-1_126
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54303-9
Online ISBN: 978-3-540-47546-0
eBook Packages: Springer Book Archive