Capacity upper bounds for deletion-type channels
- Submitting institution
-
Imperial College of Science, Technology and Medicine
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2160
- Type
- D - Journal article
- DOI
-
10.1145/3281275
- Title of journal
- Journal of the Association for Computing Machinery (ACM)
- Article number
- ARTN 9
- First page
- 1
- Volume
- 66
- Issue
- 2
- ISSN
- 0004-5411
- Open access status
- Compliant
- Month of publication
- March
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
10.1145/3281275
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper provides a radically new technique towards the eventual resolution of a core information theory open problem, capacity of the deletion channel, which is fundamental for DNA storage systems. This is an extended version of a STOC 2018 paper (http://doi.org/10.1145/3188745.3188768). Comments on the work from Prof Mitzenmacher of Harvard, the prominent figure in this area, include "as someone who worked on these problems, which I consider foundational, 15-20 years ago, seeing such remarkable and rapid progress is heartening" (letter available).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
