The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Fountain codes
Abstract
Fountain codes are record-breaking sparse-graph codes for channels with erasures, such as the internet, where files are transmitted in multiple small packets, each of which is either received without error or not received. Standard file transfer protocols simply chop a file up into K packet-sized pieces, then repeatedly transmit each packet until it is successfully received. A back channel is required for the transmitter to find out which packets need retransmitting. In contrast, fountain codes make packets that are random functions of the whole file. The transmitter sprays packets at the receiver without any knowledge of which packets are received. Once the receiver has received any N packets, where N is just slightly greater than the original file size K, the whole file can be recovered. In the paper random linear fountain codes, LT codes, and raptor codes are reviewed. The computational costs of the best fountain codes are astonishingly small, scaling linearly with the file size.
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
Error control coding : fundamentals and applications
Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,296
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
Luby, M. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181950 · Cited by 2,757
Efficient encoding of low-density parity-check codes
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910579 · Cited by 1,028
InformationTheory, Inference, and Learning Algorithms
Mackay, D. J. C. (2003) · Cited by 648
Self-citation
Research works printed but not linked: 2
- Berlekamp, E.R.: ‘Algebraic coding theory’, (McGraw-Hill, New York 1968)
- Byers, 1998, Proc. ACM SIGCOMM’98
Cited by
Survey on Free Space Optical Communication: A Communication Theory Perspective
Khalighi, M. A., & Uysal, M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2329501 · Cited by 2,466
DNA Fountain enables a robust and efficient storage architecture
Erlich, Y., & Zielinski, D. (2017) · Science · doi:10.1126/science.aaj2038 · Cited by 898
Prol, F. S., Ferre, R. M., Saleem, Z., Valisuo, P., Pinell, C., Lohan, E. S., Elsanhoury, M., Elmusrati, M., Islam, S., Celikbilek, K., et al. (2022) · IEEE Access · doi:10.1109/access.2022.3194050 · Cited by 286
Li, L., Zhao, G., & Blum, R. S. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2820021 · Cited by 282
Cooperative Edge Caching in User-Centric Clustered Mobile Networks
Zhang, S., He, P., Suto, K., Yang, P., Zhao, L., & Shen, X. (2018) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2017.2780834 · Cited by 279
Data storage in DNA with fewer synthesis cycles using composite DNA letters.
Anavy, L., Vaknin, I., Atar, O., Amit, R., & Yakhini, Z. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0240-x · Cited by 229
Encoding information into polymers
Rutten, M. G. T. A., Vaandrager, F. W., Elemans, J. A. A. W., & Nolte, R. J. M. (2018) · Nature Reviews Chemistry · doi:10.1038/s41570-018-0051-5 · Cited by 216
Reading and Writing Digital Data in DNA
Meiser, L. C., Antkowiak, P. L., Koch, J., Chen, W. D., Kohll, A. X., Stark, W. J., Heckel, R., & Grass, R. N. (2020) · Nature Protocols · doi:10.1038/s41596-019-0244-5 · Cited by 164
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
Improved read/write cost tradeoff in DNA-based data storage using LDPC codes
Chandak, S., Tatwawadi, K., Lau, B., Mardia, J., Kubit, M., Neu, J., Griffin, P., Wootters, M., Weissman, T., & Ji, H. (2019) · 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2019.8919890 · Cited by 80
Information-Theoretic Foundations of DNA Data Storage
Shomorony, I., & Heckel, R. (2022) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000117 · Cited by 62
Carbon-based archiving: current progress and future prospects of DNA-based data storage.
Ping, Z., Ma, D., Huang, X., Chen, S., Liu, L., Guo, F., Zhu, S. J., & Shen, Y. (2019) · GigaScience · doi:10.1093/gigascience/giz075 · Cited by 55
“In practice, n only needs to be slightly larger than k to yield greater coding efficiency and robustness for information communication [21].”
Metadata
- Authors
- MacKay, D. J. C.
- Venue
- IEE Proceedings - Communications
- Published
- 2005
- Volume
- 152
- Issue
- 6
- Pages
- 1062
- ISSN
- 1350-2425 (ISSN-L)
- OpenAlex
- W4237064274
- Cited by
- 899
- References
- 5
- FWCI
- 16.44
- 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.