The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
LT codes
Abstract
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.
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
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
Efficient dispersal of information for security, load balancing, and fault tolerance
Rabin, M. O. (1989) · Journal of the ACM · doi:10.1145/62044.62050 · Cited by 1,365
Efficient erasure correcting codes
Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., & Spielman, D. A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910575 · Cited by 1,180
Self-citationThe performance of TCP/IP for networks with high bandwidth-delay products and random loss
Lakshman, T. V., & Madhow, U. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.611099 · Cited by 928
Effective erasure codes for reliable computer communication protocols
Rizzo, L. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263876.263881 · Cited by 916
A reliable multicast framework for light-weight sessions and application level framing
Floyd, S., Jacobson, V., McCanne, S., Liu, C.-G., & Zhang, L. (1995) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/217382.217470 · Cited by 705
A digital fountain approach to asynchronous reliable multicast
Byers, J. W., Luby, M., & Mitzenmacher, M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803996 · Cited by 580
Self-citationTCP-like congestion control for layered multicast data transfer
Vicisano, L., Crowcroft, J., & Rizzo, L. (2002) · doi:10.1109/infcom.1998.662909 · Cited by 522
Informed content delivery across adaptive overlay networks
Byers, J. W., Considine, J., Mitzenmacher, M., & Rost, S. (2002) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/633025.633031 · Cited by 261
Cited by
DNA Fountain enables a robust and efficient storage architecture
Erlich, Y., & Zielinski, D. (2017) · Science · doi:10.1126/science.aaj2038 · Cited by 898
Reliability in wireless sensor networks: A survey and challenges ahead
Mahmood, M. A., Seah, W. K. G., & Welch, I. (2015) · Computer Networks · doi:10.1016/j.comnet.2014.12.016 · Cited by 342
A DNA-of-things storage architecture to create materials with embedded memory.
Koch, J., Gantenbein, S., Masania, K., Stark, W. J., Erlich, Y., & Grass, R. N. (2020) · Nature Biotechnology · doi:10.1038/s41587-019-0356-z · Cited by 183
An alternative approach to nucleic acid memory
Dickinson, G. D., Mortuza, G. M., Clay, W., Piantanida, L., Green, C. M., Watson, C., Hayden, E. J., Andersen, T., Kuang, W., Graugnard, E., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-22277-y · Cited by 82
Secure Image Communication using Systematic-LT Codes over AWGN Channel
Sarvepalli, G. P., Rethinam, S., Prasad, B. N. S., & Kulkarni, M. (2022) · 2022 2nd Asian Conference on Innovation in Technology (ASIANCON) · doi:10.1109/asiancon55314.2022.9909507 · Cited by 2
Metadata
- Authors
- Luby, M.
- Venue
- The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-26
- Pages
- 271-280
- OpenAlex
- W2296125569
- Cited by
- 2,757
- References
- 12
- FWCI
- 35.10
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: LT codes. https://app.cochat.ai/papers/10.1109/sfcs.2002.1181950
- The paper
- Luby, M. (2003). LT codes. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. https://doi.org/10.1109/sfcs.2002.1181950
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.
