메뉴 건너뛰기




Volumn 48, Issue 6, 2002, Pages 1451-1461

Coding theorems for turbo code ensembles

Author keywords

Bhattacharya parameter; Coding theorems; Maximum likelihood decoding (MLD); Turbo codes; Union bound

Indexed keywords

MAXIMUM LIKLIHOOD DECODING (MLD);

EID: 0036611618     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.1003833     Document Type: Article
Times cited : (68)

References (33)
  • 3
    • 0030141796 scopus 로고    scopus 로고
    • Design of parallel concatenated convolutional codes
    • May
    • (1996) IEEE Trans. Commun. , vol.44 , pp. 591-600
  • 5
    • 0031996395 scopus 로고    scopus 로고
    • Analysis, design, and iterative decoding of double serially concatenated codes with interleavers
    • Feb.
    • (1998) IEEE J. Select. Areas of Commun. , vol.16 , pp. 231-244
  • 7
    • 17644382493 scopus 로고    scopus 로고
    • Telemetry channel coding
    • May. Online
    • (1999) Blue Book , Issue.4
  • 9
    • 0002323477 scopus 로고    scopus 로고
    • A simple fight bound on error probability of block codes with application to turbo codes
    • July-Sept. Online
    • (1999) TDA Progr. Rep. , vol.139 , Issue.42
    • Divsalar, D.1
  • 19
    • 0009756915 scopus 로고    scopus 로고
    • RA codes achieve AWGN channel capacity
    • Lecture Notes in Computer Science. New York: Springer-Verlag
    • (1999) Proc. 13th Int. Symp. AAECC , vol.13 , pp. 10-18
  • 29
    • 0035442510 scopus 로고    scopus 로고
    • On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
    • Sept.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 2275-2299


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