Bounded distance + 1 soft-decision reed-solomon decoding

IEEE Transactions on Information Theory

Volumn 42, Issue 3, 1996, Pages 704-720

  Berlekamp, Elwyn ^a,b  

^a IEEE

^b Hazelnut   (United States)

Author keywords

Algebraic decoding; Decoding algorithms; Decoding beyond half minimum distance; Doubly extended codes; Probabilistic decoding; Reed solomon codes; Soft decisions

Indexed keywords

ALGORITHMS; CALCULATIONS; ERROR CORRECTION; ERRORS; PROBABILITY; QUEUEING THEORY; RELIABILITY;

ALGEBRAIC DECODING; BEST CASE DECODING; BOUNDED DISTANCE DECODING; DECODING ALGORITHMS; GENERALIZED MINIMUM DISTANCE DECODING; PROBABILISTIC DECODING; QUEUED DECODING; REED-SOLOMON CODES;

DECODING;

EID: 0030150111     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.490539     Document Type: Article

References (31)

1. K. Araki, M. Takada, and M. Morii, "The generalized .syndrome polynomial and its application to the efficient decoding of ReedSolomon codes based on GMD criteria," presented at the 1993 Int. Symp. un Information Theory, »San Antonio, TX.
2. G.A. Baker, Jr. and P. R. Graves Morris, Fade Approximatifs. Part I: Basic Theory, vol. 13 of G-C Rota, Ed., Encyclopedia of Mathematics and Its Applications. Reading, MA: Addison-Wesley, 1981.
3. _, Padé Approximatifs, Part H: Extensions and Applications, vol. 14 of G-C Rota, Ed., Encyclopedia uf Mathematics and Its Applications. Reading MA: Addison-Wesley, 1981.
4. E.R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968 and Laguna Hills, CA: Aegean Park Press, 1984.
5. _. "Factoring polynomials over large finite fields," Math. Contputat., vol. 2 no. Ill, pp. 713-735, July 1970.
6. E.R. Bsrlekamp and J. L. Ramsey, "Readable erasures improve the performance of Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. IT 24, pp. 384-386, 1978.
7. E.R. Berlekamp, "The technology of error-correcting codes," Proc. IEEE. vol. 68, pp. 564-593, 1980.
8. _, "Bit-serial Reed-Solomon encoders." IEEE Trans. Inform. Theon: vol. IT-28, pp. 869-874, 1982.
9. E.R. Berlekamp, G. Seroussi, and P. Tong. "Hypersystolic ReedSolomon decoder," U. S. Patent 4958348, issued Sept. 18, 1990.
10. R.E. Blahut, Theory and Practice of Error Control Codes. Reading MA: Addison-Wesley, 1983.
11. R.M. Fano, "A heuristic discussion of probabilistic decoding," IEEE Trans. Inform. Theory, vol. IT-9, pp. 64-74, 1963.
12. G.D. Forney, "Generalized minimum distance decoding," IEEE Trans. Inform. Theory, vol. IT-12, pp. 125-131, 1966.
13. R.G. Gailaser, Information Theory and Reliable Communication. New York: Wiley, 1968.
14. I.M. Jacobs and E. R. Berlekamp, "A lower bound to the distribution of computation for sequential decoding," IEEE Trans. Inform. Theory, vol. IT-13, pp. 167-174, 1967.
15. J. Justesen, "On the complexity of decoding Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. IT-22, pp. 237-238, 1976.
16. T. Kasami, S. Lin, and W. W. Peterson, "Some results on cyclic codes which are invariant under the afhne group and their applications," Inform. Contr., vol. 11, pp. 475-4-96, 1967.
17. D.E. Knuth, The Art of Computer Programming-Sorting and Searching, Vol 3. Reading, MA: Addison-Wesley, 1973.
18. R. Kotier. "A new efficient error-erasure location scheme in GMD decoding," presented at the 1993 Int. Symp, on Information Theeory, San Antonio, TX.
19. F.J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, vols. 1 and 2. Amsterdam, The Netherlands: North-Holland, 1977.
20. J.L. Massey, "Shift register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. IT-15, pp. 122-127, 1969.
21. R.J. McEliece, The Theory of Information and Coding, vol 3 of G-C Rota. Ed . Encyclopedia of Mathematics and Its Applications. Reading MA: Addison-Wesley, 1981.
22. M. Morii and M. Kasahara, "Generalized key-equation of Remainder Decoding Algorithm for Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. 38, pp. 1801-1807, 1992.
23. N.J. Patterson, "Algebraic decoding of Goppa codes," IEEE Trans. Inform. Theory, vol. IT-21, pp. 203-207. Mar. 1975.
24. M. Perlman, "A comparison of conventional Reed-Solomon encoders and Berlekamp's architecture," JPE Tech. Brief 5240, NASA Patent Office D1J568.
25. W.W. Peterson. Error-Correcting Codes, ambridge, MA: MIT Press, 1961.
26. D. Slepian, "A class of binary signaling alphabets" Bell Syst. Tech. J., vol. 35, pp. 203-234, 1956.
27. U.K. Sorger, "A new Reed-Solomon code decoding algorithm," IEEE Trans. Inform. Theory, vol. 39, pp. 358-365, Mar. 1993.
28. Y. Sugiyama. M. Kasahara, S. Hirasawa, and T. Namekawa, "A method for solving key equation for decoding Goppa codes," Inform. Contr., vol. 27, pp. 87-99, 1975.
29. L.R. Welch and E. R. Berlekamp, "Error correction for algebraic block codes," U. S. Patent 4633470, issued Dee. 30, 1986.
30. J.K. Wolf, "Adding two information symbols to certain nonbinary BCH codes and some applications," Bel! Sysl. Tech .1, vol. 48, no. 7, pp. 2405-2424, Sept. 1969.
31. J.M. Wozencraft and I. M. Jacobs, Sequential Decoding. Cambridge MA: MIT Press, 1961.