SCOPUS 정보 검색 플랫폼

Volumn , Issue , 2002, Pages 284-

Irregular codes from regular graphs

Author keywords

[No Author keywords available]

Indexed keywords

LOW-DENSITY PARITY-CHECK CODES (LDPCC);

CHANNEL CAPACITY; DECODING; GRAPH THEORY; OPTIMIZATION;

CODES (SYMBOLS);

EID: 0036352168 PISSN: 21578095 EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (6)

References (5)

1
- 0035246127
- Design of capacity-approaching irregular low-density parity-check codes
- (2001) IEEE Trans. on Inform. Theory , vol.47 , Issue.2 , pp. 619-637
- Richardson, T.J.¹ Shokrollahi, M.A.² Urbanke, R.L.³

2
- 0034857480
- Construction of regular and irregular LDPC codes using Ramanujan graphs and ideas from margulis
- Washington, D.C., USA, June 24-29
- (2001) Proc. IEEE Intern. Symp. on Inform. Theory , pp. 4
- Rosenthal, J.¹ Vontobel, P.O.²

3
- 0000848816
- Ramanujan graphs
- (1988) Combinatorica , vol.8 , Issue.3 , pp. 261-277
- Lubotzky, A.¹ Phillips, R.² Sarnak, P.³

4
- 0036279329
- On the construction of turbo code inter-leavers based on graphs with large girth
- New York, NY, USA, Apr. 28-May 2
- (2002) Proc. IEEE Int. Conf. Communications
- Vontobel, P.O.¹

5
- 0003252050
- Codes and iterative decoding on algebraic expander graphs
- Hawaii, USA
- (2000) Proc. of ISITA 2000
- Lafferty, J.¹ Rockmore, D.²

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