An efficient decoding of quadratic residue (QR) codes utilising hashing search to find error patterns is presented in this study. The key idea behind the proposed decoding method is theoretically based on the existence of a one-to-one mapping between the single primary known syndrome and correctable error patterns. Compared with the binary search time approach, one of the advantages of utilising this method presented in this study is that the hashing search time can be reduced by a factor of two. This method would help reduce the binary search time for finding error patterns when decoding the (23, 12, 7), (41, 21, 9), and (47, 24, 11) QR codes. Furthermore, it would reduce the decoding time by 45% using the fast lookup table decoding method to decode the (71, 36, 11) QR code. Ultimately, the proposed decoding algorithm for QR codes can be made regular, simple, and suitable for software implementations.
展开▼
