Abstract
It is shown that the Pellikaan’s decoding algorithm of some families of Goppa codes CΩ(D, G) needs at most (g+1) effective divisors if the degree of G is odd and at most ⌊lg/2⌋+1 effective divisors if the degree is even, where g is the genus of the curve used.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Carbonne. Calcul de quelques fonctions Zeta. Preprint.
C.J. Moreno. Algebraic curves over finite fields. Cambridge Tracts in Mathematics 97, Cambridge University Press 1991.
R. Pellikaan. on a decoding algorithm for codes on maximal curves. IEEE Trans Info Theory Vol 35, 6 (1989), 1228–1232.
]S.G. Vladuts. On the decoding of Algebraic Geometric Codes over Fq for q≥16. IEEE Trans Info Theory Vol 36, 6 (Nov 1990), 1461–1463.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Wien
About this chapter
Cite this chapter
Carbonne, P., Ly, A.T. (1993). Zeta Functions of Some Curves and Minimal Exponent for Pellikaan’s Decoding Algorithm of Algebraic-Geometric Codes. In: Camion, P., Charpin, P., Harari, S. (eds) Eurocode ’92. International Centre for Mechanical Sciences, vol 339. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2786-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2786-5_3
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82519-8
Online ISBN: 978-3-7091-2786-5
eBook Packages: Springer Book Archive