Advertisement

Note for computing the minimun polynomial of elements in large finite fields

  • J. A. Thiong Ly
Section III Combinatorial And Algebraic Aspects
Part of the Lecture Notes in Computer Science book series (LNCS, volume 388)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E.R.Berlekamp: Algebraic Coding Theory. Mc Graw Hill 1968.Google Scholar
  2. [2]
    R. Lidl,H. Niederreiter: Finite fields. Addison-Wesley, Reading,Massachussets,1983.Google Scholar
  3. [3]
    F.J. Mac Williams,N.J.A. Sloane: The Theory of Error Correcting Codes. North Holland, Amsterdam, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • J. A. Thiong Ly
    • 1
  1. 1.U.E.R de Maths,Infor,StatUniversité de Toulouse le MirailToulouseFrance

Personalised recommendations