메뉴 건너뛰기




Volumn 15, Issue 12, 2011, Pages 1378-1380

A simplified successive-cancellation decoder for polar codes

Author keywords

Polar codes; successive cancellation decoding

Indexed keywords

ALGORITHMIC COMPLEXITY; BLOCK ERROR RATES; CODE RATES; COMPLEXITY REDUCTION; CONVENTIONAL DECODERS; POLAR CODES;

EID: 84655166983     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2011.101811.111480     Document Type: Article
Times cited : (468)

References (7)
  • 1
    • 67650099990 scopus 로고    scopus 로고
    • Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels
    • July
    • E. Arikan, "Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051-3073, July 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.7 , pp. 3051-3073
    • Arikan, E.1
  • 3
    • 77950200691 scopus 로고    scopus 로고
    • Polar codes are optimal for lossy source coding
    • S. B. Korada and R. L. Urbanke, "Polar codes are optimal for lossy source coding," IEEE Trans. Inf. Theory, vol. 56, pp. 1751-1768, 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , pp. 1751-1768
    • Korada, S.B.1    Urbanke, R.L.2


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