Skip to main content
SpringerLink
Log in

Algorithms for Decoding and Interpolation

  • Conference paper
Codes, Systems, and Graphical Models

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 123))

Abstract

In this paper we consider various algorithms for decoding BCH/RS/ Goppa codes, in particular the euclidean algorithm, the Beriekamp-Massey algorithm and the Welch-Beriekamp algorithm. We focus on relationships of these algorithms with interpolation methods in system theory. We note that the problem statements in the two areas can be different: from a system theoretic point of view, rational interpolating functions with common factors between numerator and denominator are undesirable whereas common factors can be required in a decoding context.

The behavioral approach was introduced by Jan C. Willems into system theory in the eighties. It proposes the family of trajectories of a system as its central focus. This makes the approach attractive for coding theorists (most naturally in the context of convolutional codes where the family of trajectories corresponds to the code). In this paper we focus on a connection between behavioral modeling and the decoding of BCH/RS/Goppa codes. In this context, the behavioral modeling approach is attractive because it naturally generates solutions with common factors.

We present slight modifications of both the Berlekamp-Massey and the Welch-Berlekamp algorithm and give a derivation in terms of behavioral modeling. In particular, we derive the latter algorithm directly from Reed & Solomon’s original approach. We demonstrate the similarity of the two algorithms and show that they are special instances of one general iterative behavioral modeling procedure.

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. Antoulas, A.C., Recursive modeling of discrete-time time series, in “Linear Algebra for Control Theory”, P. Van Dooren and B. Wyman eds., Springer-Verlag, IMA, 62, 1994, 1–20.

    Google Scholar 

  2. Antoulas, A.C., J.A. Ball, J. Kang and J.C. Willems, On the solution of the minimal rational interpolation problem, Linear Alg. Appl., 137, 1990, 511–573.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  4. Berlekamp, E.R., Algebraic Coding Theory, New York, McGraw-Hill, 1968.

    Google Scholar 

  5. Berlekamp, E.R., Bounded distance + 1 soft-decision Reed-Solomon decoding, IEEE Trans. Inform. Theory, 42, 1996, 704–720.

    Article  MATH  Google Scholar 

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

    Google Scholar 

  7. Blackburn, S.R., A generalized rational interpolation problem and the solution of the Welch-Berlekamp algorithm, Designs, Codes and Cryptography, 11, 1997, 223–234.

    Google Scholar 

  8. Chambers, W.G., Solution of Welch-Berlekamp key equation by Euclidean algorithm, Electronics Letters, 29, 1993, p. 1031.

    Article  Google Scholar 

  9. Chambers, W.G., R.E. Peile, K.Y. Tsie and N. Zein, Algorithm for solving the Welch-Berlekamp key-equation, with a simplified proof, Electronics Letters, 29, 1993, 1620–1621.

    Article  Google Scholar 

  10. Dabiri, D. and I.F. Blake, Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials, IEEE Trans. Info. Theory, 41, 1995, 873–885.

    Article  MATH  Google Scholar 

  11. Gorenstein, D. and N. Zierler, A class of error correcting codes in pm symbols, Journal of the Society of Industrial and Applied Mathematics, 9, 1961, 207-214.

    Google Scholar 

  12. Guruswami, V. and M. Sudan, Improved decoding of Reed-Solomon and algebraic-geometric codes, IEEE Trans. Info. Theory, 45(6), 1999, 1757–1768.

    Article  MATH  Google Scholar 

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

    Google Scholar 

  14. Kuijper, M., Parametrizations and finite options, in “The Mathematics of Systems and Control: from Intelligent Control to Behavioral Systems” (Festschrift on the occasion of the 60th birthday of Jan C. Willems), H.L. Trentelman, J.W. Polderman eds., ISBN 90-367-1112-6, 1999, 59–72.

    Google Scholar 

  15. Kuijper, M., Further results on the use of a generalized B-M algorithm for BCH decoding beyond the designed error-correcting capability, in “Proceedings of the 13th Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (AAECC)”, Hawaii, USA, 1999, 98–99.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  17. Kuijper, M., An algorithm for constructing a minimal partial realization in the multi variable case, Systems & Control Letters, 31, 1997, 225–233.

    Article  MathSciNet  MATH  Google Scholar 

  18. Kuijper, M., Partial realization and the Euclidean algorithm, IEEE Trans. Aut. Control, 44(5), 1999, 1013–1016.

    Article  MathSciNet  MATH  Google Scholar 

  19. Kuijper, M., The Berlekamp-Massey algorithm, error-correction, keystreams and modeling, in “Dynamical Systems, Control, Coding, Computer Vision: New trends, Interfaces, and Interplay”, G. Picci, D.S. Gilliam (eds.), Birkhîuser’s series “Progress in Systems and Control Theory”, 1999, 321–341.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Nielsen, R.R. and T. Hoeholdt, Decoding Reed-Solomon codes beyond half the minimum distance, Draft manuscript, 1999.

    Google Scholar 

  22. Polderman, J.W. and J.C. Willems, Introduction to Mathematical Systems Theory—a behavioral approach, Springer Verlag, New York, 1998.

    Google Scholar 

  23. Reed, I.S. and G. Solomon, Polynomial codes over certain finite fields, SIAM Journal on Applied Mathematics, 8, 1960, 300–304.

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  25. Sudan, M., Decoding of Reed-Solomon codes beyond the error correction bound, Journal of Complexity, 13, 1997, 180–193.

    Article  MathSciNet  MATH  Google Scholar 

  26. Sudan, M., Decoding of Reed-Solomon codes beyond the error correction diameter, in “Proceedings of the 35th Allerton Conference on Communication, Control and Computing”, 1997, http://theory.lcs.mit.edu/madhu/papers.html.

    Google Scholar 

  27. Welch, L.R. and E.R. Berlekamp, Error correction for algebraic block codes, U.S. Patent 4 633 470, issued Dec. 30, 1986.

    Google Scholar 

  28. Willems, J.C., From time series to linear system. Part I: Finiteia-dimensional linear time invariant systems, Automatica, 22, 1986, 561–580.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  31. Willems, J.C., 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, 1997, 405–416.

    Google Scholar 

  32. Wolovich, W.A., Linear Multivariable Systems, Springer Verlag, New York, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of EE Engineering, University of Melbourne, VIC 3010, 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. IBM Almaden Research Center, K65-802, 650 Harry Rd., San Jose, CA, 95120, USA

    Brian Marcus

  2. Department of Mathematics, University of Notre Dame, NotreDame, IN, 46556-5683, USA

    Joachim Rosenthal

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Kuijper, M. (2001). Algorithms for Decoding and Interpolation. In: Marcus, B., Rosenthal, J. (eds) Codes, Systems, and Graphical Models. The IMA Volumes in Mathematics and its Applications, vol 123. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0165-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0165-3_14

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-95173-7

  • Online ISBN: 978-1-4613-0165-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation