Abstract
We show that an algorithm designed to solve the Welch–Berlekamp key equation may also be used to solve a more general problem, which can be regarded as a finite analogue of a generalized rational interpolation problem. As a consequence, we show that a single algorithm exists which can solve both Berlekamp's classical key equation (usually solved by the Berlekamp–Massey algorithm) and the Welch–Berlekamp key equation which arise in the decoding of Reed–Solomon codes.
Similar content being viewed by others
References
A. C. Antoulas, Recursive modelling of discrete time series, in Linear Algebra for Control Theory, Inst. Math. and Applic., Springer, Berlin, 62 (1994) pp. 1–20.
A. C. Antoulas and B. D. Q. Anderson, On the scalar rational interpolation problem, IMA J. Math. Control and Inform., Vol. 3 (1986) pp. 61–88.
A. C. Antoulas, J. A. Ball, J. Kang and J. C. Willems, On the solution of the minimal rational interpolation problem, Linear Algebra Appl., Vol. 137/138 (1990) pp. 511–573.
A. C. Antoulas and J. C. Willems, A behavioural approach to exact linear modelling, IEEE Trans. Automatic Control, Vol. 38,No. 2 (1993), pp. 1776–1802.
E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York (1968).
E. R. Berlekamp, Bounded distance + 1 soft decision Reed-Solomon decoding, (preprint).
G. D. Carter, Aspects of linear complexity, PhD thesis, University of London (1989).
W. G. Chambers, R. E. Peile, K. Y. Tsie and N. Zein, Algorithm for solving the Welch-Berlekamp key equation, with a simplified proof, Electronics Letters, Vol. 29,No. 18 (1993) pp. 1620–1621.
D. Dabiri and I. F. Blake, Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials, IEEE Trans. Inform. Theory, Vol. IT-41,No. 4 (1995) pp. 873–885.
P. Fitzpatrick, On the key equation, IEEE Trans. Inform. Theory, Vol. IT-41,No. 5 (1995) pp. 1–13.
T. H. Liu, A new decoding algorithm for Reed-Solomon codes, PhD thesis, University of Southern California, Los Angeles, CA (1984).
J. L. Massey, Shift register synthesis and BCH decoding, IEEE Trans. Inform. Theory, Vol. IT-15 (1969) pp. 122–127.
M. Morii and M. Kasahara, Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes, IEEE Trans. Inform. Theory, Vol. IT-38 (1992) pp. 1801–1807.
R. E. Peile, On the performance and complexity of a generalized minimum distance Reed-Solomon decoding algorithm, International Journal of Satellite Communications, Vol. 12,No. 4 (1994) pp. 333–359.
L. Welch and E. R. Berlekamp, Error correction for algebraic block codes, U.S. Patent 4 633 470 (1983).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Blackburn, S.R. A Generalized Rational Interpolation Problem and the Solution of the Welch–Berlekamp Key Equation. Designs, Codes and Cryptography 11, 223–234 (1997). https://doi.org/10.1023/A:1008290027201
Issue Date:
DOI: https://doi.org/10.1023/A:1008290027201