Abstract
In a recent study, Li et al. proposed an algorithm for the decoding of binary quadratic residue codes with tiny memory requirements. In this Letter, this algorithm is modified in order to dramatically improve the decoding speed. The case of the ( 89 , 45 , 17 ) binary quadratic residue code is used to illustrate the new algorithm.
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.
