The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Reliable communication over channels with insertions, deletions, and substitutions
Abstract
A new block code is introduced which is capable of correcting multiple insertion, deletion, and substitution errors. The code consists of nonlinear inner codes, which we call "watermark"" codes, concatenated with low-density parity-check codes over nonbinary fields. The inner code allows probabilistic resynchronization and provides soft outputs for the outer decoder, which then completes decoding. We present codes of rate 0.7 and transmitted length 5000 bits that can correct 30 insertion/deletion errors per block. We also present codes of rate 3/14 and length 4600 bits that can correct 450 insertion/deletion errors per block.
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
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 14,811
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
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
Self-citationThe capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
Statistical Methods for Speech Recognition
Sun, D. X., & Jelinek, F. (1999) · Journal of the American Statistical Association · doi:10.2307/2670189 · Cited by 1,946
Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
Sankoff, D., & Kruskal, J. B. (1983) · Medical Entomology and Zoology · Cited by 1,915
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
Techniques for automatically correcting words in text
Kukich, K. (1992) · ACM Computing Surveys · doi:10.1145/146370.146380 · Cited by 1,257
Low-density parity check codes over GF(q)
Davey, M. C., & MacKay, D. (1998) · IEEE Communications Letters · doi:10.1109/4234.681360 · Cited by 1,199
Self-citationIntroduction to Computational Biology
Waterman, M. S. (1995) · Springer eBooks · doi:10.1007/978-1-4899-6846-3 · Cited by 960
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
Crick, F. H. C., Griffith, J. S., & Orgel, L. E. (1957) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.43.5.416 · Cited by 333
Golomb, S. W., Gordon, B., & Welch, L. R. (1958) · Canadian Journal of Mathematics · doi:10.4153/cjm-1958-023-9 · Cited by 218
Introduction to Computational Biology: Maps, sequences and genomes
Waterman, M. S. (2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203750131 · Cited by 71
Cited by
Moulin, P., & Koetter, R. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2005.859599 · Cited by 306
Enzymatic DNA synthesis for digital information storage.
Lee, H. H., Kalhor, R., Goela, N., Bolot, J., & Church, G. M. (2018) · doi:10.1101/348987 · Cited by 265
An Artificial Chromosome for Data Storage
Chen, W., Han, M., Zhou, J., Ge, Q., Wang, P., Zhang, X., Zhu, S., Song, L., & Yuan, Y. (2021) · National Science Review · doi:10.1093/nsr/nwab028 · Cited by 136
Metadata
- Authors
- Davey, M. C., & Mackay, D. J. C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2001
- Volume
- 47
- Issue
- 2
- Pages
- 687-698
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2167082268
- Cited by
- 329
- References
- 14
- FWCI
- 11.13
- 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.