The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Linear-time encodable and decodable error-correcting codes
Abstract
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-depth circuits of linear size and decoded by logarithmic depth circuits of size O(nlogn). We present both randomized and explicit constructions of these codes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Sipser, M., & Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556667 · Cited by 931
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 326
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
Explicit Concentrators from Generalized N-Gons
Tanner, R. M. (1984) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0605030 · Cited by 247
Pippenger, N. J. (1977) · SIAM Journal on Computing · doi:10.1137/0206022 · Cited by 129
Constructions of telephone networks by group representations
Bien, F. (1989) · Notices of the American Mathematical Society · Cited by 52
The complexity of decoders--II: Computational work and decoding time
Savage, J. E. (1971) · IEEE Transactions on Information Theory · doi:10.1109/tit.1971.1054578 · Cited by 22
Cited by
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
Design of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
Regular and irregular progressive edge-growth tanner graphs
Hu, X.-Y., Eleftheriou, E., & Arnold, D. M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839541 · Cited by 1,485
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
- Spielman, D. A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1996
- Volume
- 42
- Issue
- 6
- Pages
- 1723-1731
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2135393523
- Cited by
- 350
- References
- 11
- FWCI
- 10.09
- 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.