Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound

It is shown that error-erasure decoding for a cyclic code allows the correction of a combination of t errors and r erasures when 2t+r<σ₀; the parameter σ₀ denotes a particular instance of the Hartmann-Tzeng bound. This procedure is an improvement on the error-erasure decoding algorithm developed by G.D. Forney (1965), which works when 2t+r<σ, where σ denotes the BCH-bound of the code