Abstract
A high-speed and memory-efficient table lookup decoding algorithm (TLDA), called the syndrome and syndrome difference decoding algorithm (SSDDA), is developed to decode the long binary systematic (71, 36, 11) quadratic residue (QR) code. The essential point of the SSDDA is based on the property of the weight of syndrome and the weight of syndrome difference to reduce the memory size of the lookup table. The proposed algorithm generates a novel compact lookup table (CLT), which only consists of 7,806 syndromes and their corresponding error patterns. Consequently, the memory size of the proposed CLT is only about 38.39% of the lookup table proposed by Lin et al.
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.
