Abstract
It is shown how binary polynomial residue codes which are equivalent in error-correcting power to shortened Reed-Solomon (R-S) codes can be decoded efficiently with binary operations using the Berlekamp algorithm. For R-S codes correcting single error bursts, it is shown how the Chien search can be reduced by reducing the number of points substituted in the error location polynomial. For certain cases, the amount of multiplications needed to evaluate the error location polynomial at a given element of a Galois field can be reduced. This would apply to all BCH 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.
