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 >