Skip to main content
SpringerLink
Log in

The Berlekamp-Massey Algorithm revisited

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to explain it in a simpler way and to adapt it to lazy evaluation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York, ch. 7 1968

  2. Cheng, U.: On the continued fraction and Berlekamp's algorithm. IEEE Trans. Inform. Theory, vol. IT-30, 541–44 (1984)

    Google Scholar 

  3. Dornstetter, J.L.: On the equivalence Between Berlekamp's and Euclid's Algorithm. IEEE Trans. Inform. Theory, vol. IT-33, 3, 428–431 (1987)

  4. Jonckheere, E., Ma, C.: A simple Hankel Interpretation of the Berlekamp–Massey Algorith. Linear Algebra and its Applications 125, 65–76 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Massey, J.L.: Shift register synthesis and BCH decoding. IEEE Trans. Inform. Theory, vol. IT-15, 122–127 (1969)

    Google Scholar 

  6. Mills, W.H.: Continued Fractions and Linear Recurrences. Math. Comput. 29, 173–180 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pan, V.: New Techniques for the Computation of linear recurrence coefficients. Finite Fields and Their Applications 6, 93–118 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Shoup, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press 2005

  9. Sugiyama, Y. et al.: A method for solving key equation for decoding Goppa codes. Infor. Contr. vol 27, 87–99 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  10. Welch, L.R., Scholtx, R.A.: Continued fractions and Berlekamp's algorithm. IEEE Trans. Inform. Theory, vol. IT-25, 18–27 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Equipe de Mathématiques, CNRS UMR 6623, UFR des Sciences et Techniques, Université de Franche-Comté, 25 030, Besançon cedex, France

    Nadia Ben Atti & Henri Lombardi

  2. Dpto. de Matematicas Aplicada, Universidad de Murcia, Spain

    Gema M. Diaz–Toca

Authors
  1. Nadia Ben Atti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gema M. Diaz–Toca
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Henri Lombardi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gema M. Diaz–Toca.

Additional information

partially supported by the Galois Theory and Explicit Methods in Arithmetic Project HPRN-CT-2000-00114

partially supported by the European Union funded project RAAG CT-2001-00271

Rights and permissions

Reprints and permissions

About this article

Cite this article

Atti, N., Diaz–Toca, G. & Lombardi, H. The Berlekamp-Massey Algorithm revisited. AAECC 17, 75–82 (2006). https://doi.org/10.1007/s00200-005-0190-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-005-0190-z

Mathematics Subject Classification (2000)

Keywords

Search

Navigation