For binary reconstruction codes correcting one deletion and one substitution, redundancy 0, 1, 2, log log n+3, log n+1, and 3 log n+4 suffice when the number of reads N is 4n−8, 3n−4, 2n+9, n+21, 31, and 7, respectively.
Efficient l ow-redundancy codes for correcting multiple deletions,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Binary Reconstruction Codes for Correcting One Deletion and One Substitution
For binary reconstruction codes correcting one deletion and one substitution, redundancy 0, 1, 2, log log n+3, log n+1, and 3 log n+4 suffice when the number of reads N is 4n−8, 3n−4, 2n+9, n+21, 31, and 7, respectively.