SCOPUS 정보 검색 플랫폼

Volumn , Issue , 2002, Pages 1-

Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ERASURE CHANNELS (BEC); FINITE-LENGTH ANALYSIS;

ALGORITHMS; ERROR ANALYSIS; OPTIMIZATION; PROBABILITY;

BINARY CODES;

EID: 0036350650 PISSN: 21578095 EISSN: None Source Type: Journal
DOI: 10.1109/ISIT.2002.1023273 Document Type: Article

Times cited : (38)

References (5)

1
- 0034857441
- Capacity achieving sequences for the erasure channel
- Washington DC
- (2001) Proceedings of the International Symposium on Information Theory , pp. 48
- Oswald, P.¹ Shokrollahi, A.²

2
- 84888076581
- Finite length analysis of low-density parity-check ensembles for the binary erasure channel
- (2001) Allerton Conf. on Communication, Control and Computing
- Di, C.¹ Proietti, D.² Richardson, T.³ Telatar, E.⁴ Urbanke, R.⁵

3
- 85013603961
- Finite length analysis of LDPC codes with large left degrees
- (2001) Submitted IEEE International Symposium on Information Theory
- Zhang, J.¹ Orlitsky, A.²

5
- 0034850871
- Weight distributions: How deviant can you be?
- Washington, DC, June 24-June 29
- (2001) 2001 IEEE International Symposium on Information Theory , pp. 50
- Di, C.¹ Richardson, T.² Urbanke, P.³

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