SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

IEEE Transactions on Information Theory

Volumn 47, Issue 2, 2001, Pages 569-584

Efficient erasure correcting codes

(4) Luby, Michael G a,c Mitzenmacher, Michael b Shokrollahi, M Amin c Spielman, Daniel A d

a NATIONAL SCIENCE FOUNDATION (United States)

b HEWLETT PACKARD COMPANY (United States)

c INTERNATIONAL COMPUTER SCIENCE INSTITUTE (United States)

d Department of Mathematics ^* (United States)

Author keywords

Erasure channel; Large deviation analysis; Low density parity check codes

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; GRAPH THEORY; RANDOM PROCESSES;

ERASURE CORRECTING CODES;

CODES (SYMBOLS);

EID: 0035246316 PISSN: 00189448 EISSN: None Source Type: Journal
DOI: 10.1109/18.910575 Document Type: Article

Times cited : (843)

References (26)

1
- 0030287317
- A linear time erasure-resilient code with nearly optimal recovery
- Nov
- (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 1732-1736
- Alon, N.¹ Luby, M.²

2
- 0027297425
- Near Shannon limit error-correcting coding and decoding
- Geneva, Switzerland, May
- (1993) Proc. Int. Conf. Communication (ICC'93) , pp. 1064-1070
- Berrou, C.¹ Glavieux, A.² Thitimajshima, P.³

3
- 0003517783
- Reading, MA: Addison-Wesley
- (1983) Theory and Practice of Error Control Codes
- Blahut, R.E.¹

4
- 0001780655
- Coding for two noisy channels
- (1955) Information Theory, 3rd London Symp. , pp. 61-76
- Elias, P.¹

5
- 0030371894
- Analysis of two simple heuristics on a random instance of k-SAT
- (1996) J. Algorithms , vol.20 , pp. 312-355
- Frieze, A.¹ Suen, S.²

6
- 84988739181
- Cambridge, MA: MIT Press
- (1963) Low Density Parity-Check Codes
- Gallager, R.G.¹

7
- 0019673359
- Maximum matchings in sparse random graphs
- (1981) Proc. 22nd FOCS , pp. 364-375
- Karp, R.¹ Sipser, M.²

8
- 0004294036
- Approximation of population processes
- SIAM
- (1981) CBMS-NSF Regional Conf. Series in Applied Math.
- Kurtz, T.G.¹

9
- 0032258155
- Analysis of random processes via and-or tree evaluation
- (1998) Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms , pp. 364-373
- Luby, M.¹ Mitzenmacher, M.² Shokrollahi, M.A.³

10
- 0031642584
- Analysis of low density codes and improved designs using irregular graphs
- (1998) Proc. 30th Annu. ACM Symp. Theory of Computing , pp. 249-258
- Luby, M.¹ Mitzenmacher, M.² Shokrollahi, M.A.³ Spielman, D.⁴

11
- 70349515451
- Improved low-density parity-check codes using irregular graphs and belief propagation
- (1998) Proc. IEEE Int. Symp. Information Theory , pp. 117

12
- 0005188837
- Analysis of low density codes and improved designs using irregular graphs
- Feb
- (2000) IEEE Trans. Inform. Theory , vol.47 , pp. 671-686

13
- 0030671783
- Practical loss-resilient codes
- (1997) Proc. 29th Annu. ACM Symp. Theory of Computing , pp. 150-159
- Luby, M.¹ Mitzenmacher, M.² Shokrollahi, M.A.³ Spielman, D.⁴ Stemann, V.⁵

14
- 0033337059
- Comparison of constructions of irregular Gallager codes
- Oct
- (1999) IEEE Trans. Commun. , vol.47 , Issue.10 , pp. 1449-1454
- MacKay, D.¹ Wilson, S.² Davey, M.³

15
- 0030219216
- Near Shannon limit performance of low density parity check codes
- (1996) Electron. Lett. , vol.32 , Issue.18 , pp. 1645-1646
- MacKay, D.J.C.¹ Neal, R.M.²

16
- 0003525990
- Amsterdam, The Netherlands: North-Holland
- (1988) The Theory of Error-Correcting Codes
- MacWilliams, F.J.¹ Sloane, N.J.A.²

17
- 0004155132
- Ph.D. dissertation, Univ. Calif, Berkeley
- (1996) The power of two choices in randomized load balancing
- Mitzenmacher, M.¹

18
- 0012580950
- Tight thresholds for the pure literal rule
- (1997) DEC/SRC, Tech. Rep. 1997-001

19
- 0004168557
- Cambridge, U.K.: Cambridge Univ. Press
- (1995) Randomized Algorithms
- Motwani, R.¹ Raghavan, P.²

20
- 0030144334
- Sudden emergence of a giant k-core in a random graph
- (1996) J. Comb. Theory, Ser. B , vol.67 , pp. 111-151
- Pittel, B.¹ Spencer, J.² Wormald, N.³

21
- 0035246127
- Design of capacity-approaching irregular low-density parity-check codes
- Feb
- (2000) IEEE Trans. In-from. Theory , vol.47 , pp. 619-637
- Richardson, T.¹ Shokrollahi, M.A.² Urbanke, R.³

22
- 0035246307
- The capacity of low-density parity check codes under message-passing decoding
- Feb
- (2000) IEEE Trans. Inform. Theory , vol.47 , pp. 599-618
- Richardson, T.¹ Urbanke, R.²

23
- 84957715479
- New sequences of linear time erasure codes approaching the channel capacity
- M. Fossorier, H. Imai, S. Lin, and A. Poli, Eds. Berlin, Germany: Springer-Verlag
- (1999) Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (Lecture Notes in Computer Science) , pp. 65-76
- Shokrollahi, M.A.¹

24
- 0030290419
- Expander codes
- Nov
- (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 1710-1722
- Sipser, M.¹ Spielman, D.²

25
- 0030283874
- Linear-time encodable and decodable error-correcting codes
- Nov
- (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 1723-1731
- Spielman, D.¹

26
- 21344437483
- Differential equations for random processes and random graphs
- (1995) Ann. Appl. Probab. , vol.5 , pp. 1217-1235
- Wormald, N.C.¹

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