In this paper, a new decoding algorithm, called modified reduced lookup table decoding (MRLTD) algorithm, is proposed for decoding [47, 24, 11] quadratic residue (QR) code which needs lower memory requirement compared with the algorithm based on the full lookup table and the cyclic weight decoding algorithm (CWDA). Although the memory requirements (space complexity) of the proposed algorithm are the same with a newly optimized cyclic weight (OCW) decoding algorithm, the proposed MRLTD algorithm is faster, i.e. the running-time complexity of the proposed algorithm is lower than OCW algorithm. The idea behind this decoding technique is based on the existence of a one-to-one relation between the syndromes and correctable error patterns, reported in a lookup table containing 300 syndromes which are searched by a binary search algorithm. Moreover, by a bit modification on MRLTD algorithm, it can be applied to decode effectively the extended [47, 24, 11] QR code, i.e. [48, 24, 12] QR code, applicable for correcting five errors and detecting six errors.

本文提出了一种新的解码算法，称为改进的简化查找表解码（MRLTD）算法，用于解码[ 47、24、11 ]二次余数（QR）码，与基于完整算法的算法相比，该算法需要较低的存储需求。查找表和循环权重解码算法（CWDA）。尽管所提出算法的存储要求（空间复杂度）与最新优化的循环权重（OCW）解码算法相同，所提出的MRLTD算法速度更快，即所提出算法的运行时间复杂度低于OCW算法。该解码技术背后的思想是基于在校正子和可纠正错误模式之间存在一对一的关系，该关系在包含300个校正子的查找表中进行了报告，该查询通过二进制搜索算法进行搜索。此外，通过对MRLTD算法进行一些修改，可以将其有效地解码为扩展的[47、24、11] QR码，即[48、24、12] QR码，适用于校正五个错误和检测六个错误。