Abstract
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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
