Abstract
Starting from results on elliptic curves and Kloosterman sums over the finite field GF(2t), we determine the weights of the orthogonals of the following binary linear codes : the Melas code of length 2t−1, the irreducible cyclic binary code of length 2t+1, and the extended binary Goppa codes defined by polynomials of degree two.
Preview
Unable to display preview. Download preview PDF.
References
BERLEKAMP, E.R.,MORENO, O., "Extended double-error correcting binary GOPPA codes are cyclic" IEEE Trans.Info.Theory 19 (1973),817–818.
LACHAUD,G.,WOLFMANN,J., "Sommes de Kloosterman,courbes elliptiques et codes cycliques en caracteristique 2" C.R.Acad.Sci.Paris (1),305 (1987)
McWILLIAMS, F.J.,SLOANE, N.J.A., "The theory of Error-correcting codes" North-Holland, Amsterdam, 1977.
TZENG, K.K.,ZIMMERMANN, K., "On extending GOPPA codes to cyclic codes" IEEE Trans.Info.Theory 21 (1975),712–716.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wolfmann, J. (1989). The weights of the orthogonals of certain cyclic codes or extended GOPPA codes. In: Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1988. Lecture Notes in Computer Science, vol 357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51083-4_84
Download citation
DOI: https://doi.org/10.1007/3-540-51083-4_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51083-3
Online ISBN: 978-3-540-46152-4
eBook Packages: Springer Book Archive