A partitioning theorem reduces t-deletion plus s-substitution correction to burst-deletion correction, yielding VT-based codes that match or slightly improve known redundancy bounds.
Explicit two-deletion codes with redundancy matching the existential bound,
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
-
Correcting Errors Through Partitioning and Burst-Deletion Correction
A partitioning theorem reduces t-deletion plus s-substitution correction to burst-deletion correction, yielding VT-based codes that match or slightly improve known redundancy bounds.