On error-and-erasure decoding of cyclic codes

Procedures are presented for error-and-erasure decoding of cyclic codes up to the Hartmann-Tzeng (HT) bound. Emphasis is placed on converting the problem of error-and-erasure decoding to an error-only decoding problem so that the Berlekamp-Massey or the Feng-Tzeng multisequence shift-register synthesis algorithms can be applied. This work has thus extended the result, which was up to a special case of the HT bound, obtained by P. Stevens (1990) on error-and-erasure decoding of binary cyclic codes.<
>