RECORD
Shift-Interleave Coding for DNA-Based Storage: Correction of IDS Errors and Sequence Losses
Information Theory · Submitted 26 Jan 2024
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim The numerical results demonstrate the excellent performance of the SI coding scheme in correcting both IDS errors and sequence losses.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We propose a novel coding scheme for DNA-based storage systems, called the shift-interleave (SI) coding, designed to correct insertion, deletion, and substitution (IDS) errors, as well as sequence losses. The SI coding scheme employs multiple codewords from two binary low-density parity-check codes. These codewords are processed to form DNA base sequences through shifting, bit-to-base mapping, and interleaving. At the receiver side, an efficient non-iterative detection and decoding scheme is employed to sequentially estimate codewords. The numerical results demonstrate the excellent performance of the SI coding scheme in correcting both IDS errors and sequence losses.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We propose a novel coding scheme for DNA-based storage systems, called the shift-interleave (SI) coding, designed to correct insertion, deletion, and substitution (IDS) errors, as well as sequence losses. | contribution 1.00 | 0.88 | 0.30 | asserted 1.00 |
| s1 | The SI coding scheme employs multiple codewords from two binary low-density parity-check codes. | method 0.98 | 0.66 | 0.03 | asserted 1.00 |
| s2 | These codewords are processed to form DNA base sequences through shifting, bit-to-base mapping, and interleaving. | method 1.00 | 0.66 | 0.03 | asserted 1.00 |
| s3 | At the receiver side, an efficient non-iterative detection and decoding scheme is employed to sequentially estimate codewords. | method 0.99 | 0.71 | 0.04 | asserted 1.00 |
| s4 | The numerical results demonstrate the excellent performance of the SI coding scheme in correcting both IDS errors and sequence losses. | result 0.94 | 0.94 | 0.84 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We propose a novel coding scheme for DNA-based storage systems, called the shift-interleave (SI) coding, designed to correct insertion, deletion, and substitution (IDS) errors, as well as sequence losses. The SI coding scheme employs multiple codewords from two binary low-density parity-check codes. These codewords are processed to form DNA base sequences through shifting, bit-to-base mapping, and interleaving. At the receiver side, an efficient non-iterative detection and decoding scheme is employed to sequentially estimate codewords. The numerical results demonstrate the excellent performance of the SI coding scheme in correcting both IDS errors and sequence losses.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.