메뉴 건너뛰기




Volumn , Issue 146, 1998, Pages 137-141

Improved Soft-Decision Decoding of Reed-Muller Codes as Generalized Multiple Concatenated Codes

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0347804946     PISSN: 09326022     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article
Times cited : (13)

References (9)
  • 1
    • 0029229981 scopus 로고
    • Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
    • Jan.
    • G. Schnabl and M. Bossert, "Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes," IEEE Transactions on Information Theory, vol. 41, no. 1, pp. 304-308, Jan. 1995.
    • (1995) IEEE Transactions on Information Theory , vol.41 , Issue.1 , pp. 304-308
    • Schnabl, G.1    Bossert, M.2
  • 2
    • 0017922440 scopus 로고
    • Efficient maximum likelihood decoding of linear block codes using a trellis
    • January
    • J. K. Wolf, "Efficient maximum likelihood decoding of linear block codes using a trellis," IEEE Transactions on Information Theory, vol. IT-24, no. 1, pp. 76-80, January 1978.
    • (1978) IEEE Transactions on Information Theory , vol.IT-24 , Issue.1 , pp. 76-80
    • Wolf, J.K.1
  • 3
    • 0022719911 scopus 로고
    • Optimal soft-decision block decoders based on fast hadamard transform
    • Y. Be'ery and J. Synders, "Optimal soft-decision block decoders based on fast hadamard transform," IEEE Transactions on Information Theory, vol. IT-32, pp. 355-364, 1986.
    • (1986) IEEE Transactions on Information Theory , vol.IT-32 , pp. 355-364
    • Be'ery, Y.1    Synders, J.2
  • 4
    • 84941860379 scopus 로고
    • Coset codes - Part ii: Binary lattices and related codes
    • September
    • G. D. Forney, "Coset codes - part ii: Binary lattices and related codes," IEEE Transactions on Information Theory, vol. 34, no. No. 5, pp. 1152-1187, September 1988.
    • (1988) IEEE Transactions on Information Theory , vol.34 , Issue.5 , pp. 1152-1187
    • Forney, G.D.1
  • 5
    • 0029276653 scopus 로고
    • Asymptotically good codes have infinite trellis complexity
    • A. Larfourcade and A. Vardy, "Asymptotically good codes have infinite trellis complexity," IEEE Transactions on Information Theory, vol. 41, pp. 555-559, 1995.
    • (1995) IEEE Transactions on Information Theory , vol.41 , pp. 555-559
    • Larfourcade, A.1    Vardy, A.2
  • 7
    • 0028370481 scopus 로고
    • An upper bound on the effective error coefficient of two-stage decoding, and good two-level decompositions of some reed-muller codes
    • 3 February/March/April
    • J. Wu, S. Lin, T. Kasami, T. Fujiwara, and T. Takata, "An upper bound on the effective error coefficient of two-stage decoding, and good two-level decompositions of some reed-muller codes," IEEE Transactions on Communications, vol. 2/3/4, no. 42, pp. 813-818, February/March/April 1994.
    • (1994) IEEE Transactions on Communications , vol.2-4 , Issue.42 , pp. 813-818
    • Wu, J.1    Lin, S.2    Kasami, T.3    Fujiwara, T.4    Takata, T.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.