메뉴 건너뛰기




Volumn 9, Issue 6, 1999, Pages 521-546

BCJR trellis and trellis decoders for some BCH codes

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; TRELLIS CODES;

EID: 0033165347     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000050116     Document Type: Article
Times cited : (2)

References (27)
  • 1
    • 0031701575 scopus 로고    scopus 로고
    • On hybrid stack decoding algorithms for block codes
    • L. E. Aguado, P. G. Farrell: On hybrid stack decoding algorithms for block codes, IEEE Trans Inf Theory, 44(1), 398-409 (1998)
    • (1998) IEEE Trans Inf Theory , vol.44 , Issue.1 , pp. 398-409
    • Aguado, L.E.1    Farrell, P.G.2
  • 2
    • 0016037512 scopus 로고
    • Optimal decoding of linear codes for minimizing symbol error rate
    • L. R. Bahl, J. Cocke, F. Jelinek, J. Raviv: Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans Inf Theory 20(2), 284-287 (1974)
    • (1974) IEEE Trans Inf Theory , vol.20 , Issue.2 , pp. 284-287
    • Bahl, L.R.1    Cocke, J.2    Jelinek, F.3    Raviv, J.4
  • 3
    • 0027555114 scopus 로고
    • An updated table of minimum-distance bounds for binary linear codes
    • A. E. Brouwer, T. Verhoeff: An updated table of minimum-distance bounds for binary linear codes, IEEE Trans Inf Theory 39(2), 662-677 (1993)
    • (1993) IEEE Trans Inf Theory , vol.39 , Issue.2 , pp. 662-677
    • Brouwer, A.E.1    Verhoeff, T.2
  • 5
    • 0009349983 scopus 로고    scopus 로고
    • Capacity grows with demand in ReFLEX protocol
    • J. Dorenbosch: Capacity grows with demand in ReFLEX protocol, Wireless Systems Design 3(1), 46-54 (1998)
    • (1998) Wireless Systems Design , vol.3 , Issue.1 , pp. 46-54
    • Dorenbosch, J.1
  • 6
    • 84941860379 scopus 로고
    • Coset codes - Part II: Binary lattices and related codes
    • G. D. Forney. Jr.: Coset codes - Part II: Binary lattices and related codes, IEEE Trans Inf Theory 34(5), 1152-1187 (1988)
    • (1988) IEEE Trans Inf Theory , vol.34 , Issue.5 , pp. 1152-1187
    • Forney G.D., Jr.1
  • 7
    • 0028547151 scopus 로고
    • Dimension/length profiles and trellis complexity of linear block codes
    • G. D. Forney. Jr.: Dimension/length profiles and trellis complexity of linear block codes, IEEE Trans Inf Theory 40(6), 1741-1752 (1994)
    • (1994) IEEE Trans Inf Theory , vol.40 , Issue.6 , pp. 1741-1752
    • Forney G.D., Jr.1
  • 8
    • 0027257044 scopus 로고
    • On the optimum bit orders with respect to state complexity of trellis diagrams for linear block codes
    • T. Kasami, T. Takata, T. Fujiwara, S. Lin: On the optimum bit orders with respect to state complexity of trellis diagrams for linear block codes. IEEE Trans Inf Theory 39(1), 242-243 (1993)
    • (1993) IEEE Trans Inf Theory , vol.39 , Issue.1 , pp. 242-243
    • Kasami, T.1    Takata, T.2    Fujiwara, T.3    Lin, S.4
  • 11
    • 0029276653 scopus 로고
    • Asymptotically good codes have infinite trellis complexity
    • A. Lafourcade-Jumembo, A. Vardy: Asymptotically good codes have infinite trellis complexity. IEEE Trans Inf Theory 41(2), 555-558 (1995)
    • (1995) IEEE Trans Inf Theory , vol.41 , Issue.2 , pp. 555-558
    • Lafourcade-Jumembo, A.1    Vardy, A.2
  • 12
  • 14
    • 0031358691 scopus 로고    scopus 로고
    • BCJR trellis construction for binary linear block codes
    • H. H. Manoukian, B. Honary: BCJR trellis construction for binary linear block codes, IEE Proc.-Commun 144(6), 367-371 (1997)
    • (1997) IEE Proc.-Commun , vol.144 , Issue.6 , pp. 367-371
    • Manoukian, H.H.1    Honary, B.2
  • 17
    • 2342658588 scopus 로고
    • Reed-Solomon codes and the exploration of the solar system
    • S. B. Wicker, V. K. Bhargava (eds) IEEE press
    • R. J. McEliece, L. Swanson: Reed-Solomon codes and the exploration of the solar system, In: S. B. Wicker, V. K. Bhargava (eds) Reed-Solomon Codes and Their Applications, IEEE press, 1994
    • (1994) Reed-Solomon Codes and their Applications
    • McEliece, R.J.1    Swanson, L.2
  • 18
    • 0030195678 scopus 로고    scopus 로고
    • On the BCJR trellis for linear block codes
    • R. J. McEliece: On the BCJR trellis for linear block codes, IEEE Trans Inf Theory 42(4), 1072-1092 (1996)
    • (1996) IEEE Trans Inf Theory , vol.42 , Issue.4 , pp. 1072-1092
    • McEliece, R.J.1
  • 19
    • 0024078703 scopus 로고
    • Minimal trellises for block codes
    • D. J. Muder: Minimal trellises for block codes, IEEE Trans Inf Theory 34(5), 1049-1053 (1988)
    • (1988) IEEE Trans Inf Theory , vol.34 , Issue.5 , pp. 1049-1053
    • Muder, D.J.1
  • 22
    • 0028388409 scopus 로고
    • Maximum-likelihood soft decision decoding of BCH codes
    • A. Vardy, Y. Be'ery: Maximum-likelihood soft decision decoding of BCH codes, IEEE Trans Inf Theory, 40(2) 546-554 (1994)
    • (1994) IEEE Trans Inf Theory , vol.40 , Issue.2 , pp. 546-554
    • Vardy, A.1    Be'ery, Y.2
  • 26
    • 0017922440 scopus 로고
    • Efficient maximum likelihood decoding of linear block codes using a trellis
    • J. K. Wolf: Efficient maximum likelihood decoding of linear block codes using a trellis, IEEE Trans Inf Theory IT-24(1), 76-80 (1978)
    • (1978) IEEE Trans Inf Theory IT-24 , Issue.1 , pp. 76-80
    • Wolf, J.K.1
  • 27
    • 0029271967 scopus 로고
    • On the trellis complexity of certain binary linear codes
    • Ø. Ytrehus: On the trellis complexity of certain binary linear codes, IEEE Trans Inf Theory 41(2), 559-560 (1995)
    • (1995) IEEE Trans Inf Theory , vol.41 , Issue.2 , pp. 559-560
    • Ytrehus, Ø.1


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