Generalized Minimum Distance Decoding Algorithms for Qary Output Channels

IEEE Transactions on Information Theory

Volumn 26, Issue 2, 1980, Pages 238-243

  Yu, Christopher C H ^a   Costello, Daniel J ^a  

^a ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0018996610     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1980.1056148     Document Type: Article

References (11)

1. G. D. Forney, Jr. “Generalized minimum distance decoding,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 125–131, Apr. 1966.
2. —, Concatenated codes. Cambridge, MA: MIT, 1966.
3. E. J. Weldon, Jr. “Decoding binary block codes on Q-ary output channels,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 713–718, Nov. 1971.
4. J. L. Massey, “Threshold decoding,” Cambridge, MA: MIT, 1963.
5. G. Einarsson and C. E. Sundberg “A note on soft decision decoding with successive erasures,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 88–96, Jan. 1976.
6. C. C. Yu, “Efficient decoding algorithms for linear codes on soft-quantized channels,” Ph.D. dissertation, Illinois Inst, of Technology, 1978.
7. S. Wainberg “Error-erasure decoding of product codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 821–823, Nov. 1972.
8. L. D. Rudolph, C. R. P. Hartmann, T. Y. Hwang, and N. Q. Due “Algebraic analog decoding of linear binary codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 430–440, July 1979.
9. C. E. Sundberg, “One-step majority-logic decoding with symbol reliability information,” IEEE Trans. Inform. Theory, vol. IT-21. pp. 236–242, Mar. 1975.
10. D. Chase and H. D. Goldfein, “Long block codes can offer good performance,” IEEE Int. Symp. Inform. Theory, Ithaca, NY, Oct. 10–14, 1977.
11. H. Tanaka, K. Furusawa, and S. Kaneku, “A novel approach to soft decision decoding of threshold decodable codes,” in this issue, pp. 244–246.