Codes Correcting Bounded Length Tandem Duplication

In this paper we extend the problem of correcting a tandem duplication of a fixed number of symbols to the problem of correcting a tandem duplication of a bounded length. This type of error can be represented as a repetition of a symbols block. We propose the upper and the lower bounds on the cardinality based on the sphere-packing bound and constructions of codes correcting one tandem duplication of a bounded length based on Varshamov-Tenengolts code.