Abstract
We describe two methods for computing the minimun polynomial of an element in the finite field GF(qm);both methods have pratically no storage constraint and may improve by a factor 2.6 the classical method.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.R.Berlekamp: Algebraic Coding Theory. Mc Graw Hill 1968.
R. Lidl,H. Niederreiter: Finite fields. Addison-Wesley, Reading,Massachussets,1983.
F.J. Mac Williams,N.J.A. Sloane: The Theory of Error Correcting Codes. North Holland, Amsterdam, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thiong Ly, J.A. (1989). Note for computing the minimun polynomial of elements in large finite fields. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019856
Download citation
DOI: https://doi.org/10.1007/BFb0019856
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51643-9
Online ISBN: 978-3-540-46726-7
eBook Packages: Springer Book Archive