1. Araki, K. and I. Fujita (1992). Generalized syndrome polynomials for decoding Reed-Solomon codes.IEICE Trans. FundamentalsE75–A, 1026–1029.

   Google Scholar 

2. Araki, K., Takada, M. and M. Morii (1992). On the efficient decoding of Reed-Solomon codes based on GMD criterion.Proc. 22nd Int. Symp. on Multiple Valued Logic, 138–142.

   Google Scholar 

3. Araki, K., Takada, M. and M. Morii (1993). The efficient GMD decoders for BCH codes.IEICE Trans. Inform. and SystemsE76–D, 594–604.

   Google Scholar 

4. Berlekamp, E.R. (1996). Bounded distance+1 soft-decision Reed-Solomon decoding.IEEE Trans. Inform. Theory42, 704–721.

   Article MATH  Google Scholar 

5. Blackburn, S.R. (1997). A generalized rational interpolation problem and the solution of the WB algorithm.Designs,Co des and Cryptography11, 223–234.

   Article MATH MathSciNet  Google Scholar 

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

   Google Scholar 

7. Elias, P. (1954). Error-free coding.IRE Trans. Inform. TheoryPGIT–4, 29–37.

   Article MathSciNet  Google Scholar 

8. Fitzpatrick, P. (1995). On the key equation.IEEE Trans. Inform. Theory41, 1290–1302.

   Article MATH MathSciNet  Google Scholar 

9. Forney, G.D., Jr. (1966). Generalized minimum distance decoding.IEEE Trans. Inform. Theory12, 125–131.

   Article MATH MathSciNet  Google Scholar 

10. Fujisawa, M. and S. Sakata (1999). On fast generalized minimum distance decoding for algebraic codes.Preproc. AAECC-13, 82–83.

    Google Scholar 

11. Kamiya, N. (1995). On multisequence shift register synthesis and generalizedminimum-distance decoding of Reed-Solomon codes.Finite Fields Appl.1, 440–457.

    Article MATH MathSciNet  Google Scholar 

12. Kamiya, N. (1999). A unified algorithm for solving key equations for decoding alternant codes.IEICE Trans. Fundamentals,E82–A, 1998–2006.

    Google Scholar 

13. Kobayashi, Y., Fujisawa, M. and S. Sakata (2000). Constrained shiftregister synthesis: fast GMD decoding of 1D algebraic codes.IEICE Trans. Fundamentals83, 71–80.

    Google Scholar 

14. Kötter, R. (1996). Fast generalized minimum distance decoding of algebraic geometric and Reed-Solomon codes.IEEE Trans. Inform. Theory42, 721–738.

    Article MATH MathSciNet  Google Scholar 

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

    Article MATH MathSciNet  Google Scholar 

16. Kuijper, M. (1999). The BM algorithm, error-correction, keystreams and modeling. InDynamical Systems,Control, Coding,Computer Vision, G. Picci, D. S. Gilliam (eds.), Birkhäuser

    Google Scholar 

17. Kuijper, M. (1999). Further results on the use of a generalized BM algorithm for BCH decoding beyond the designed error-correcting capability,Proc. 13th AAECC, Hawaii, USA (1999), 98–99.

    Google Scholar 

18. Kuijper, M. (2000). Algorithms for Decoding and Interpolation. InCodes,Systems, and Graphical Models, IMA Series Vol. 123, B. Marcus and J. Rosenthal (eds.), pp. 265–282, Springer-Verlag.

    Google Scholar 

19. Kuijper, M. (2000). A system-theoretic derivation of the WB algorithm, inProc. IEEE International Symposium on Information Theory (ISIT’00) p. 418.

    Google Scholar 

20. Sorger, U. (1993). A new Reed-Solomon decoding algorithm based on Newton’s interpolation.IEEE Trans. Inform. Theory39, 358–365.

    Article MATH MathSciNet  Google Scholar 

21. Taipale, D.J. and M.J. Seo (1994). An efficient soft-decision Reed-Solomon decoding algorithm.IEEE Trans. Info. Theory40, 1130–1139.

    Article MATH MathSciNet  Google Scholar 

22. Wicker, S.B. (1995).Error control systems, Prentice Hall.

    Google Scholar 

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

    Article MATH MathSciNet  Google Scholar 

Download references