Abstract
In this paper, three algebraic decoding algorithms are proposed for the binary quadratic residue (QR) codes generated by irreducible polynomials. The polynomial relations among the syndromes and the coefficients of the error-locator polynomials have been computed with Lagrange interpolation formula (LIF). Unlike some previous QR decoders, which may take several iterations to decode a corrupted word, the iteration number of the first two algorithms is at most one. The processes in the first algorithm are the calculation of consecutive syndromes, inverse-free Berlekamp-Massey algorithm (IFBMA), and the Chien search. One of Orsini-Sala's results on the structure of general error-locator polynomials is generalized and applied to derive the second (respectively, third) algorithm that consists of the determination of general error-locator polynomial (respectively, classical error-locator polynomials) and the Chien search. Finally, the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(17, 9, 5), (23, 12, 7)</i> , and (41, 21, 9) QR decoders are illustrated and their complexity analyses are given.
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.
