Capacity Results for the Noisy Shuffling Channel
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Motivated by DNA-based storage, we study the noisy shuffling channel, which can be seen as the concatenation of a standard noisy channel (such as the BSC) and a shuffling channel, which breaks the data block into small pieces and shuffles them. This channel models a DNA storage system, by capturing two of its key aspects: (1) the data is written onto many short DNA molecules that are stored in an unordered way and (2) the molecules are corrupted by noise at synthesis, sequencing, and during storage. For the BSC-shuffling channel we characterize the capacity exactly (for a large set of parameters), and show that a simple index-based coding scheme is optimal.
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
Towards Practical, High-Capacity, Low-Maintenance Information Storage in Synthesized DNA
Goldman, N., Bertone, P., Chen, S., Dessimoz, C., LeProust, E. M., Sipos, B., & Birney, E. (2013) · Nature · doi:10.1038/nature11875 · Cited by 1,220 · cited 1×
“Computer scientists and engineers have dreamed of harnessing DNA’s storage capabilities already in the 60s [1, 2], and in recent years this idea has developed into an active field of research: In 2012 and 2013 groups lead by Church [3] and Goldman [4] independently stored about a megabyte of data in DNA.”
BackgroundDNA Fountain enables a robust and efficient storage architecture
Erlich, Y., & Zielinski, D. (2017) · Science · doi:10.1126/science.aaj2038 · Cited by 898 · cited 1×
“Later, in the same year, Yazdi et al [6] showed how to selectively access files, and in 2017, Erlich and Zielinski [7] demonstrated that practical DNA storage can achieve very high information densities.”
BackgroundRandom access in large-scale DNA data storage
Organick, L., Ang, S. D., Chen, Y.-J., Lopez, R., Yekhanin, S., Makarychev, K., Racz, M. Z., Kamath, G., Gopalan, P., Nguyen, B., et al. (2018) · Nature Biotechnology · doi:10.1038/nbt.4079 · Cited by 775 · cited 1×
“[8] scaled up these techniques and stored about 200 megabytes of data.”
MethodRobust Chemical Preservation of Digital Information on DNA in Silica with Error-Correcting Codes
Grass, R. N., Heckel, R., Puddu, M., Paunescu, D., & Stark, W. J. (2015) · Angewandte Chemie International Edition · doi:10.1002/anie.201411378 · Cited by 754 · cited 1×
“[5] demonstrated that millenia long storage times are possible by protecting the data both physically and information-theoretically, and designed a robust DNA data storage scheme using modern error correcting codes.”
MethodSelf-citationFundamental limits of DNA storage systems
Heckel, R., Shomorony, I., Ramchandran, K., & Tse, D. N. C. (2017) · 2017 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8007106 · Cited by 123 · cited 5×
“Similar to our previous work [9], we let L = β logM , and consider the asymptotic regime M → ∞.”
BackgroundResultInfluentialSelf-citationA Characterization of the DNA Data Storage Channel
Heckel, R., Mikutis, G., & Grass, R. N. (2019) · Scientific Reports · doi:10.1038/s41598-019-45832-6 · Cited by 9 · cited 1×
“Since in all recently proposed systems [3– 8], substitution errors are more frequent than insertion and deletion errors [14], we focus on substitution noise.”
BackgroundSelf-citation
Cited by
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
Cheraghchi, M., Gabrys, R., Milenkovic, O., & Ribeiro, J. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2996377 · Cited by 90
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
“Recent work in [15] and [16] studied the information-theoretic capacity of a DNAbased storage channel, however the work has limited practical applicability due to various unrealistic assumptions and the asymptotic nature of their results.”
Background
Metadata
- Authors
- Shomorony, I., & Heckel, R.
- Venue
- 2019 IEEE International Symposium on Information Theory (ISIT)
- Publisher
- IEEE
- Published
- 2019-07
- Pages
- 762-766
- OpenAlex
- W2915917693
- Cited by
- 56
- References
- 6
- FWCI
- 26.59
- Type
- conference paper
- Language
- en
- Open access
- green
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: Capacity Results for the Noisy Shuffling Channel. https://app.cochat.ai/papers/10.1109/isit.2019.8849789
- The paper
- Shomorony, I., & Heckel, R. (2019). Capacity Results for the Noisy Shuffling Channel. 2019 IEEE International Symposium on Information Theory (ISIT). https://doi.org/10.1109/isit.2019.8849789
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.