Michael Sipser, Daniel A. Spielman  Home/Search
Context Related
| mit.edu/~spielman/ITexpanderc.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~spielman/the...expanders (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Using expander graphs, we construct a new family of asymptotically good, linear errorcorrecting codes. These codes have linear time sequential decoding algorithms and logarithmic time parallel decoding algorithms that use a linear number of processors. We present both randomized and explicit constructions of these codes. Experimental results demonstrate the good performance of the randomly chosen codes. (Update)
Cited by: More
IEEE Communications Magazine . August 2003 132.. - Capacity Approaching.. (Correct)
International Symposium on Information Theory and Its.. - John Laerty School (Correct)
Ordered Binary Decision Diagrams - And Minimal Trellises (Correct)
Similar documents (at the sentence level):
10.1%: Linear-Time Encodable and Decodable Error-Correcting Codes - Spielman (1996) (Correct)
Active bibliography (related documents): More All
0.5: Unknown - Incomd Sciencecolum By (Correct)
0.4: Highly Fault-Tolerant Parallel Computation (Extended Abstract) - Spielman (Correct)
0.3: On the Probe Complexities of Membership and Perfect Hashing - Pagh (Correct)
Similar documents based on text: More All
0.7: Expander Codes - Sipser, Spielman (1996) (Correct)
0.6: Codes And Iterative Decoding on Algebraic Expander Graphs - Lafferty, Rockmore (2000) (Correct)
0.6: On Expander Codes - Zemor (1999) (Correct)
Related documents from co-citation: More All
40: Low-density parity-check codes (context) - Gallager - 1962
25: Good Error Correcting Codes Based on Very Sparse Matrices - MacKay, Neal
22: A recursive approach to low complexity codes (context) - Tanner - 1981
BibTeX entry: (Update)
M. Sipser, D. A. Spielman, "Expander Codes", IEEE Transactions on Information Theory, 42(6), November 1996, pp. 1710-1722. http://citeseer.ist.psu.edu/sipser96expander.html More
@inproceedings{ sipser94expander,
author = "Michael Sipser and Daniel A. Spielman",
title = "Expander Codes",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "566-576",
year = "1994",
url = "citeseer.ist.psu.edu/sipser96expander.html" }
Citations (may not include all citations):1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
957 The Probabilistic Method (context) - Alon, Spencer - 1992
860 The Theory of Error-Correcting Codes (context) - MacWilliams, Sloane - 1977
341 Low Density Parity-Check Codes (context) - Gallager - 1963
148 Ramanujan graphs (context) - Lubotzky, Phillips et al. - 1988
141 The complexity of finite functions (context) - Boppana, Sipser - 1990
126 Eigenvalues and expanders (context) - Alon - 1986
90 Introduction to Coding Theory (context) - van Lint - 1992
88 A recursive approach to low complexity codes (context) - Tanner - 1981
88 Deterministic simulation in logspace (context) - Ajtai, Koml'os et al. - 1987
73 Linear-time encodable and decodable error-correcting codes - Spielman - 1996
68 Explicit group theoretical constructions of combinatorial sc.. (context) - Margulis - 1988
58 Construction of asymptotically good low-rate error-correctin.. (context) - Alon, Bruck et al. - 1992
54 Explicit constructions of concentrators (context) - Margulis - 1973
54 Explicit constructions of concentrators (context) - Margulis - 1975
35 Explicit construction of linear sized tolerant networks (context) - Alon, Chung - 1988
33 Derandomized graph products - Alon, Feige et al. - 1995
26 Storage modification machines (context) - Schonhage - 1980
25 The Complexity of Computing (context) - Savage - 1976
16 the second eigenvalue and linear expansion of regular graphs (context) - Kahale - 1992
9 Explicit concentrators from generalized n-gons (context) - Tanner - 1984
7 Essentials of Error-Control Coding Techniques (context) - Imai - 1990
7 Constructions of telephone networks by group representations (context) - Bien - 1989
6 Estimation of the error-correction complexity of Gallager lo.. (context) - Zyablov, Pinsker - 1976
5 Information storage in a memory assembled from unreliable co.. (context) - Kuznetsov - 1973
5 American Mathematical Society Translations (context) - Kolmogorov, Uspenski et al. - 1963
4 Computationally efficient error-correcting codes and hologra.. (context) - Spielman - 1995
3 Theory of computation: How to start (context) - Levin - 1991
3 Natural bounded concentrators (context) - Morgenstern - 1995
2 Existance and explicit constructions of q+1 regular Ramanuja.. (context) - Morgenstern - 1994
2 English translation in [KU (context) - Kolmogorov, Uspenski et al. - 1958
2 Kolmogorov machines and related issues - Gurevich - 1988
1 The memory-refresh problem (context) - Pippenger - 1988
1 Personal communication (context) - Pippenger - 1994
1 Expander Graphs (context) - Kahale - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-math.mit.edu/~spielman/theory/expanders.html):
Expander Codes - Sipser, Spielman (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC