Block codes capable of correcting both additive and timing errors

Binary block codes are constructed that are capable of correcting successive timing errors such as the deletion or insertion of
s
bits
(s\leq D)
within a single additive burst of errors of length
b
or less
(b=f+g+2D)
, where
f
and
D
are the design parameters that specify the length of correctable successive timing errors and
g
is the length of the correctable additive burst. A decoding algorithm is given and the efficiency of these codes is discussed.