New bounds on the cardinality of double synchronization-error-correcting codes

This paper presents improved upper and lower bounds on the cardinality of binary codes capable of correcting one or two random synchronization errors per codeword. These bounds were derived by determining and considering the Hamming distance properties of the double synchronization-error-correcting codes. These new bounds are compared with known bounds for such codes.<
>