  In this paper we study codes for correcting deletable errors in binary words,
where each bit is either retained, substituted, erased or deleted and the total
number of errors is much smaller compared to the length of the codeword. We
construct codes capable of correcting errors in the received codeword in
real-time with small delay and low probability of decoding error.
