Abstract
The BCH algorithm is extended to correct more errors than indicated by the BCH bound. In the first step of the decoding procedure, a number of errors corresponding to a particular case of the Hartmann-Tzeng bound are corrected. In the second step full error correction is the goal. A measure for the worst-case number of field elements of an extension field GF(2/sup m/) that must be tested for this purpose is given for binary cyclic linear unequal error protection codes as well as for conventional binary cyclic codes.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
