Skip to main content
SpringerLink
Log in

The Berlekamp-Massey algorithm, error-correction, keystreams and modeling

  • Conference paper
Dynamical Systems, Control, Coding, Computer Vision

Part of the book series: Progress in Systems and Control Theory ((PSCT,volume 25))

Abstract

The areas of system theory and coding theory are more or less equally “young”, having their origins around the fifties. Throughout their history, there have been observations on the existence of connections between the two areas. One of the first of these observations was concerned with the Berlekamp-Massey algorithm, derived in [5, 22] for the purpose of decoding BCH/Reed-Solomon codes. Indeed, following upon Massey’s exposition in [22], Sain pointed out in [26] that what the Berlekamp-Massey algorithm solves is “a version of the widely conceived engineering black box problem”.

Supported by the Australian Research Council

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, B.M., F.M. Brasch jr. and P.V. Lopresti (1975). The sequential construction of minimal partial realizations from finite input-output data. SIAM J. Control 13, 552–571.

    Article  MathSciNet  MATH  Google Scholar 

  2. Antoulas, A.C. (1986). On recursiveness and related topics in linear systems. IEEE Trans. Aut. Control 31, 1121–1135.

    Article  MathSciNet  MATH  Google Scholar 

  3. Antoulas, A.C. (1994). Recursive modeling of discrete-time time series, in Linear Algebra for Control Theory, P. Van Dooren and B. Wyman eds., Springer-Verlag, IMA 62, 1–20.

    Chapter  Google Scholar 

  4. Antoulas, A.C. and J.C. Willems (1993). A behavioral approach to linear exact modeling. IEEE Trans. Aut. Control 38, 1776–1802.

    Article  MathSciNet  MATH  Google Scholar 

  5. Berlekamp, E.R. (1968). Algebraic Coding Theory, New York, McGraw-Hill.

    MATH  Google Scholar 

  6. Blahut, R.E. (1983). Theory and Practice of Error Control Codes, Addison-Wesley.

    MATH  Google Scholar 

  7. Dickinson, B.W., M. Morf and T. Kailath (1974). A minimal realization algorithm for matrix sequences. IEEE Trans. Aut. Control 19, 31–38.

    Article  MathSciNet  MATH  Google Scholar 

  8. Feng, G-L. and K.K. Tzeng (1991). A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes. IEEE Trans. Info. Theory 37, 1274–1287.

    Article  MathSciNet  MATH  Google Scholar 

  9. Fitzpatrick, P. and G.H. Norton (1995). The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain. Applicable Algebra in Engineering, Communication and Computing 6, 309–323.

    Article  MathSciNet  MATH  Google Scholar 

  10. Golomb, S.W. (1967). Shift register sequences, Holden-Day, San Francisco.

    MATH  Google Scholar 

  11. Gragg, W.B. and A. Lindquist (1983). On the partial realization problem. Lin. Alg. Appl. 50, 277–319.

    Article  MathSciNet  MATH  Google Scholar 

  12. Imamura, K. and W. Yoshida (1987). A simple derivation of the Berlekamp-Massey algorithm and some applications. IEEE Trans. Info. Theory 33, 146–150.

    Article  MathSciNet  MATH  Google Scholar 

  13. Jonckheere, E. and C. Ma (1989). A simple Hankel interpretation of the Berlekamp-Massey algorithm. Lin. Alg. Appl. 125, 65–76.

    Article  MathSciNet  MATH  Google Scholar 

  14. Kailath, T. (1994). Encounters with the Berlekamp-Massey algorithm, in Communications and Cryptography; two sides of one tapestry (1994 Massey Symposium), R. Blahut, Kluwer, 209–220.

    Google Scholar 

  15. Kalman, R.E. (1971). On minimal partial realizations of a linear input/output map, in Aspects of Network and System Theory, R.E. Kalman and N. DeClaris eds., Holt, Rinehart and Winston, New York, 385–408.

    Google Scholar 

  16. Kalman, R.E. (1979). On partial realizations, transfer functions, and canonical forms. Acta Polytechnica Scandinavica, Math. Comp. Sc. Series, 31, 9–32.

    MathSciNet  MATH  Google Scholar 

  17. Kuijper, M. and J.C. Willems (1997). On constructing a shortest linear recurrence relation. IEEE Trans. Aut. Control 42, 1554–1558.

    Article  MathSciNet  MATH  Google Scholar 

  18. Kuijper, M. (1994). First-Order Representations of Linear Systems. Series on “Systems and Control: Foundations and Applications”, Birkhäuser, Boston.

    Google Scholar 

  19. Kuijper, M. (1997). An algorithm for constructing a minimal partial realization in the multivariable case. Systems & Control Letters 31, 225–233.

    Article  MathSciNet  MATH  Google Scholar 

  20. Kuijper, M. (1997). Partial realization and the euclidean algorithm, to appear in IEEE Trans. Aut. Control.

    Google Scholar 

  21. Kuijper, M. (1997). How to construct a periodically time-varying system of minimal lag: an algorithm based on twisting, to appear in Automatica.

    Google Scholar 

  22. Massey, J.L. (1969). Shift-register synthesis and BCH decoding. IEEE Trans. Info. Theory 15, 122–127.

    Article  MathSciNet  MATH  Google Scholar 

  23. Roos, C. (1983). A new lower bound for the minimum distance of a cyclic code. IEEE Trans. Info. Theory 29, 330–332.

    Article  MathSciNet  MATH  Google Scholar 

  24. Rueppel, R.A. (1986). Analysis and Design of Stream Ciphers, Springer-Verlag.

    MATH  Google Scholar 

  25. Sugiyama, Y., Kasahara, M., Hirasawa, S. and T. Namekawa (1975). A method for solving key equation for decoding Goppa codes. Information and Control 27, 87–99.

    Article  MathSciNet  MATH  Google Scholar 

  26. Sain, M.K. (1975). Minimal torsion spaces and the partial input/output problem. Information and Control 29, 103–124.

    MathSciNet  MATH  Google Scholar 

  27. Van Barel, M. and A. Bultheel (1989). A canonical matrix continued fraction solution of the minimal (partial) realization problem. Lin. Alg. Appl. 122/123/124, 973–1002.

    Article  Google Scholar 

  28. L.R. Welch and R.A. Scholtz (1979). Continued fractions and Berlekamp’s algorithm. IEEE Trans. Info. Theory 25, 19–27.

    Article  MathSciNet  MATH  Google Scholar 

  29. Willems, J.C. (1986). Prom time series to linear system. Part I: Finite-dimensional linear time invariant systems. Automatica 22, 561–580.

    Article  MathSciNet  MATH  Google Scholar 

  30. Willems, J.C. (1986). From time series to linear system. Part II: Exact modeling. Automatica 22, 675–694.

    Article  MathSciNet  MATH  Google Scholar 

  31. Willems, J.C. (1991). Paradigms and puzzles in the theory of dynamical systems. IEEE Trans. Aut. Control 36, 259–294.

    Article  MathSciNet  MATH  Google Scholar 

  32. Willems, J.C. (1997). Fitting data sequences to linear systems, in Systems and Control in the Twenty-First Century, C.I. Byrnes, B.N. Datta, C.F. Martin and D.S. Gilliam eds., Birkhäuser, Boston, (invited papers presented at the 12th MTNS, 1996, St. Louis ), 405–416.

    Google Scholar 

  33. Wolovich, W.A. (1974). Linear Multivariable Systems, Springer Verlag, New York.

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Electronic Engineering, University of Melbourne, Parkville, Victoria, 3052, Australia

    Margreet Kuijper

Authors
  1. Margreet Kuijper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Elettronica e Informatica, Università di Padova, vai Gradenigo, 6/A, 35131, Padova, Italia

    Giorgio Picci

  2. Department of Mathematics and Statistics, Texas Tech University, Box 41042, 79409-1042, Lubbock, TX, USA

    David S. Gilliam

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Birkhäuser Verlag Basel/Switzerland

About this paper

Cite this paper

Kuijper, M. (1999). The Berlekamp-Massey algorithm, error-correction, keystreams and modeling. In: Picci, G., Gilliam, D.S. (eds) Dynamical Systems, Control, Coding, Computer Vision. Progress in Systems and Control Theory, vol 25. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-8970-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8970-4_15

  • Publisher Name: Birkhäuser Basel

  • Print ISBN: 978-3-0348-9848-5

  • Online ISBN: 978-3-0348-8970-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation