For codes correcting constant numbers of deletions, insertions, substitutions, and adjacent transpositions, maximum size is at most C q^n / n^t, proving redundancy at least t log n minus O(1).
Bit Loss and Gain Correction Code,
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
-
On the Maximum Size of Codes Under the Damerau-Levenshtein Metric
For codes correcting constant numbers of deletions, insertions, substitutions, and adjacent transpositions, maximum size is at most C q^n / n^t, proving redundancy at least t log n minus O(1).