## Duplication-Correcting Codes. (arXiv:1712.09345v1 [cs.IT])

In this work, we propose constructions that correct duplications of multiple
consecutive symbols. These errors are known as tandem duplications, where a
sequence of symbols is repeated; respectively as palindromic duplications,
where a sequence is repeated in reversed order. We compare the redundancies of
these constructions with code size upper bounds that are obtained from sphere
packing arguments. Proving that an upper bound on the code cardinality for
tandem deletions is also an upper bound for inserting tandem duplications, we
derive the bounds based on this special tandem deletion error as this results
in tighter bounds. Our upper bounds on the cardinality directly imply lower
bounds on the redundancy which we compare with the redundancy of the best known
construction correcting arbitrary burst insertions. Our results indicate that
the correction of palindromic duplications requires more redundancy than the
correction of tandem duplications and both significantly less than arbitr查看全文