Complementary Interpolants and a Welch-Berlekamp-style Algorithm
Author:
Armand Marc André
Publisher
Springer London
Reference9 articles.
1. Berlekamp, E. (1996). Bounded distance +1 soft-decision Reed-Solomon decoding. IEEE Trans. Inform. Theory,42–3, 704–720.
2. Blackburn, S.R. (1997). A generalized rational interpolation problem and the solution of the Welch-Berlekamp key equation. Designs, Codes and Cryptography, 11–3, 223–234.
3. Blackburn, S.R. (1997). Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences. IEEE Trans. Inform. Theory, 43–2, 537–548.
4. Chambers, W.G., Peile, R.E., Tsie, K.Y., Zein, N. (1993). Algorithm for solving the Welch-Berlekamp key-equation, with a simplified proof. Electronic Letters, 29–18, 1620–1621.
5. Jennings, S.M. (1995). Gröbner basis view of Welch-Berlekamp algorithm for Reed-Solomon codes. IEEE Proc. Comm., 142–6, 349–351.