메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 573 LNCS, Issue , 1992, Pages 113-119
Soft decoding for block codes obtained from convolutional codes
Author keywords

[No Author keywords available]
Indexed keywords

ALGEBRA; CONVOLUTION; DECODING; MAXIMUM LIKELIHOOD;
EID: 18544371327     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0034347     Document Type: Conference Paper
Times cited : (3)
References (10)
  • 1
    • 0022665432 scopus 로고
    • On the tail biting convolutional codes
    • H. Ma, J.K. Wolf. On the tail biting convolutional codes. IEEE Trans. Commun., 1986, v.34, 2, p.104–111.
    • (1986) IEEE Trans. Commun , vol.34 , Issue.2 , pp. 104-111
    • Ma, H.1    Wolf, J.K.2
  • 2
    • 0015943124 scopus 로고
    • Convolutional codes, 2: Maximum likelihood decoding
    • G.D. Forney. Convolutional codes, 2: Maximum likelihood decoding. Information and Control, 1974, v.25, 3, p. 222–266.
    • (1974) Information and Control , vol.25 , Issue.3 , pp. 222-266
    • Forney, G.D.1
  • 4
    • 0005729841 scopus 로고
    • On the complexity of decoding linear codes
    • G.S. Evseev. On the complexity of decoding linear codes. Probl. Pered. Inf., 1983, v. 19, 1, p.3–8.
    • (1983) Probl. Pered. Inf , vol.19 , Issue.1 , pp. 3-8
    • Evseev, G.S.1
  • 5
    • 0005654225 scopus 로고
    • An algorithm of concatenative decoding with incomplete code vectors look through
    • A.M. Barg, I.I. Dumer. An algorithm of concatenative decoding with incomplete code vectors look through. Probl. Pered. Inf., 1986, v.22, 1, p.3–10.
    • (1986) Probl. Pered. Inf. , vol.22 , Issue.1 , pp. 3-10
    • Barg, A.M.1    Dumer, I.I.2
  • 6
    • 18544388541 scopus 로고
    • A bound on the decoding complexity of linear block codes
    • Krouck E.A. A bound on the decoding complexity of linear block codes. Probl. Pered. Inf., 1989, v.25, 3, p. 103–106.
    • (1989) Probl. Pered. Inf , vol.25 , Issue.3 , pp. 103-106
    • Krouck, E.A.1
  • 7
    • 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. Inform. Theory, 1978, v.24, 1, p.76–80.
    • (1978) IEEE Trans. Inform. Theory , vol.24 , Issue.1 , pp. 76-80
    • Wolf, J.K.1
  • 8
    • 84938020456 scopus 로고
    • On complexity of maximum likelihood decoding for the best concatenated codes
    • I.I. Dumer. On complexity of maximum likelihood decoding for the best concatenated codes. 8-th conf. on coding and inf. theory, Moscow-Kuybyshev, 1981, 2, p.66–69.
    • (1981) 8-Th Conf. on Coding and Inf. Theory, Moscow-Kuybyshev , vol.2 , pp. 66-69
    • Dumer, I.I.1
  • 9
    • 0008241387 scopus 로고
    • Block codes from convolutional codes
    • Kudryashov B.D., Zakharova T.G. Block codes from convolutional codes. Probl. Pered. Inf., 1989, v.25, 4, p.98–102.
    • (1989) Probl. Pered. Inf , vol.25 , Issue.4 , pp. 98-102
    • Kudryashov, B.D.1    Zakharova, T.G.2
  • 10
    • 0008199088 scopus 로고
    • Decoding of block codes obtained from convolutional codes
    • Kudryashov B.D. Decoding of block codes obtained from convolutional codes. Probl. Pered. Inf., 1990, v.26, 3, p.18–26.
    • (1990) Probl. Pered. Inf , vol.26 , Issue.3 , pp. 18-26
    • Kudryashov, B.D.1

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