The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Expander codes
Abstract
Using expander graphs, we construct a new family of asymptotically good, linear error-correcting 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
A recursive approach to low complexity codes
Tanner, R. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056404 · Cited by 3,138
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Lubotzky, A., Phillips, R., & Sarnak, P. (1988) · Combinatorica · doi:10.1007/bf02126799 · Cited by 1,011
Linear-time encodable and decodable error-correcting codes
Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556668 · Cited by 350
Self-citationExplicit construction of linear sized tolerant networks
Alon, N., & Chung, F. (1988) · Discrete Mathematics · doi:10.1016/0012-365x(88)90189-6 · Cited by 322
Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q
Morgenstern, M. (1994) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.1994.1054 · Cited by 310
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
Alon, N., Bruck, J., Naor, J., Naor, M., & Roth, R. M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119713 · Cited by 257
The Complexity of Finite Functions
BOPPANA, R. B., & SIPSER, M. (1990) · Algorithms and Complexity · doi:10.1016/b978-0-444-88071-0.50019-9 · Cited by 251
Self-citationExplicit Concentrators from Generalized N-Gons
Tanner, R. M. (1984) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0605030 · Cited by 247
Alon, N., Feige, U., Wigderson, A., & Zuckerman, D. (1995) · Computational Complexity · doi:10.1007/bf01277956 · Cited by 152
Constructions of telephone networks by group representations
Bien, F. (1989) · Notices of the American Mathematical Society · Cited by 52
Computationally efficient error-correcting codes and holographic proofs
Spielman, D. A., & Sipser, M. (1995) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 46
Self-citationON KOLMOGOROV MACHINES AND RELATED ISSUES
Gurevich, Y. G. (1993) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812794499_0017 · Cited by 31
Cited by
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
Chung, S.-Y., Forney, G. D., Richardson, T. J., & Urbanke, R. (2001) · IEEE Communications Letters · doi:10.1109/4234.905935 · Cited by 1,539
Mechanism Design via Differential Privacy
McSherry, F., & Talwar, K. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.66 · Cited by 1,371
Low-density parity-check codes based on finite geometries: a rediscovery and new results
Kou, Y., Lin, S., & Fossorier, M. P. C. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959255 · Cited by 1,302
Metadata
- Authors
- Sipser, M., & Spielman, D. A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1996
- Volume
- 42
- Issue
- 6
- Pages
- 1710-1722
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2293231900
- Cited by
- 931
- References
- 16
- FWCI
- 13.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.