메뉴 건너뛰기




Volumn , Issue , 1998, Pages 31-

On the minimum distance of parallel and serially concatenated codes

Author keywords

[No Author keywords available]

Indexed keywords

COMPONENT CODES; FREE DISTANCE; HIGH PROBABILITY; MINIMUM DISTANCE; PARALLEL BRANCHES; PARALLEL CONCATENATED CODES; SERIALLY CONCATENATED CODES;

EID: 84890380792     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.708611     Document Type: Conference Paper
Times cited : (44)

References (8)
  • 1
    • 0027297425 scopus 로고
    • Near Shannon limit error-correcting coding and decoding
    • (Geneve, Switzerland) May
    • C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding," in Proceedings of IGC'93, (Geneve, Switzerland), pp. 1064-1070, May 1993.
    • (1993) Proceedings of IGC'93 , pp. 1064-1070
    • Berrou, C.1    Glavieux, A.2    Thitimajshima, P.3
  • 2
    • 0030106621 scopus 로고    scopus 로고
    • Unveiling turbo codes: Some results on parallel concatenated coding schemes
    • Mar.
    • S. Benedetto and G. Montorsi, "Unveiling turbo codes: some results on parallel concatenated coding schemes," IEEE Trans, Inform. Theory, vol. 42, pp. 409-428, Mar. 1996.
    • (1996) IEEE Trans, Inform. Theory , vol.42 , pp. 409-428
    • Benedetto, S.1    Montorsi, G.2
  • 3
    • 0030141796 scopus 로고    scopus 로고
    • Design of parallel concatenated convolutional codes
    • May
    • S. Benedetto and G. Montorsi, "Design of parallel concatenated convolutional codes," IEEE Trans. Commun., vol. 44, pp. 591-600, May 1996.
    • (1996) IEEE Trans. Commun. , vol.44 , pp. 591-600
    • Benedetto, S.1    Montorsi, G.2


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