| Summary: | 碩士 === 義守大學 === 資訊工程學系 === 104 === An efficient decoding of the (73, 37, 13) quadratic residue (QR) codes utilizing hashing search to find error patterns was 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 primary known syndromes in connection with the cyclotomic coset properties and correctable error patterns that is different only used signal primary known syndrome the (23, 12, 7), (41, 21, 9), (47, 24, 11) and (71,36, 11) QR codes. Compared with the binary search time approach, one of the advantages of utilizing 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 (73, 36, 11) QR code. Ultimately, the proposed decoding algorithm for QR codes can be made regular, simple, and suitable for software implementations.
|
|---|
