Abstract

Recently, it was shown how to determine the error locator polynomial of a primitive, binary t-error correcting BCH code in a single step [3]. For this purpose it is necessary to transform the set of t syndrome polynomial equations to an equivalent set of polynomial equations, leading to an analytic expression for the error locator polynomial, /spl sigma/(x). These results facilitate decoding beyond the BCH bound, i.e. correcting more than t errors. This requires the resolving of additional syndromes coefficients, which is achieved in a simple and elegant way by means of the expression derived for the syndrome polynomial /spl sigma/(x).

Full Text
Paper version not known

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 call

Disclaimer: 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.