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.
Asymptotically optimum binary code with correction for losses of one or two adjacent bits,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 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.