메뉴 건너뛰기




Volumn 44, Issue 7, 1998, Pages 3091-3096

A new treatment of priority-first search maximum- likelihood soft-decision decoding of linear block codes

Author keywords

Decoding; Dijkstra's algorithm; Linear block codes; Maximum likelihood, priority first search; Soft decision

Indexed keywords

ALGORITHMS; DECISION THEORY; DECODING; GRAPH THEORY; MAXIMUM LIKELIHOOD ESTIMATION;

EID: 0032202050     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.737538     Document Type: Article
Times cited : (8)

References (10)
  • 1
    • 0027668419 scopus 로고
    • Efficient priority- First search maximum-likelihood soft-decision decoding of linear block codes
    • Sept.
    • Y. S. Han, C. R. P. Hartmann, and C.-C. Chebn, "Efficient priority- first search maximum-likelihood soft-decision decoding of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1514-1523, Sept. 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 1514-1523
    • Han, Y.S.1    Hartmann, C.R.P.2    Chebn, C.-C.3
  • 3
    • 0022719911 scopus 로고
    • Optimal soft decsion block decoders based on fast hadamrad transform
    • Y. Be'ery and J. Snyders, "Optimal soft decsion block decoders based on fast hadamrad transform," IEEE Trans. Inform. Theory, vol. 42, pp. 355-364, 1986.
    • (1986) IEEE Trans. Inform. Theory , vol.42 , pp. 355-364
    • Be'ery, Y.1    Snyders, J.2
  • 4
    • 0026157330 scopus 로고
    • More efficient soft-decision decoding of the golay codes
    • A. Vardy and Y. Be'ery, "More efficient soft-decision decoding of the golay codes," IEEE Trans. Inform. Theory, vol. 37, pp. 667-672, 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 667-672
    • Vardy, A.1    Be'ery, Y.2
  • 5
    • 0026117536 scopus 로고
    • Bit-level soft decision decoding of Reed-Solomon codes
    • _, "Bit-level soft decision decoding of Reed-Solomon codes," IEEE Trans. Commun., vol. 39, pp. 440-445, 1991.
    • (1991) IEEE Trans. Commun. , vol.39 , pp. 440-445
  • 6
    • 0024733559 scopus 로고
    • Maximum likelihood soft decoding of binary block codes and decoders for the golay codes
    • Sept.
    • J. Snyders and Y. Be'ery, "Maximum likelihood soft decoding of binary block codes and decoders for the golay codes," IEEE Trans. Inform. Theory, vol. 35, pp. 963-975, Sept. 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.35 , pp. 963-975
    • Snyders, J.1    Be'ery, Y.2
  • 7
    • 0030247095 scopus 로고    scopus 로고
    • A* decoding of block codes
    • Sept.
    • L. Ekroot and S. Dolinar, "A* decoding of block codes," IEEE Trans. Commun., vol. 44, pp. 1052-1056, Sept. 1996.
    • (1996) IEEE Trans. Commun. , vol.44 , pp. 1052-1056
    • Ekroot, L.1    Dolinar, S.2
  • 8
    • 0028429264 scopus 로고
    • Soft trellis-based decoder for linear block codes
    • May
    • Y. Berger and Y. Be'ery, "Soft trellis-based decoder for linear block codes," IEEE Trans. Inform. Theory, vol. 40, pp. 764-773, May 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 764-773
    • Berger, Y.1    Be'Ery, Y.2
  • 9
    • 0017922440 scopus 로고
    • Efficient maximum likelihood decoding of linear block codes using a trellis
    • Jan.
    • J. K. Wolf, "Efficient maximum likelihood decoding of linear block codes using a trellis," IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, Jan. 1978.
    • (1978) IEEE Trans. Inform. Theory , vol.IT-24 , pp. 76-80
    • Wolf, J.K.1
  • 10
    • 0028388696 scopus 로고
    • An efficient maximum-likelihood decoding algorithm for linear block codes with algebraic decoder
    • Mar.
    • T. Kancko, T. Nishijima, H. Inazumi, and S. Hirasawa, "An efficient maximum-likelihood decoding algorithm for linear block codes with algebraic decoder," IEEE Trans. Inform. Theory, vol. 40, pp. 320-327, Mar. 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 320-327
    • Kancko, T.1    Nishijima, T.2    Inazumi, H.3    Hirasawa, S.4


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