Decoding the (31, 16, 7) Quadratic Residue Code in GF(2^5)

摘要：

The binary QR codes are well known for their good behavior. The proposed algebraic decoding algorithm for decoding the (31, 16, 7) QR code with reducible generator polynomial is able to correct up to three errors in the finite field GF(25). The proposed algorithm is based on an application of the decoding algorithm given by Truong et al. and Chen et al. to modify the decoding algorithm proposed by Reed et al. All syndromes in the error-locator polynomial are computed in the finite field GF(25). Thus, the decoding time can be reduced. Moreover, the simulation results for comparing the proposed decoding algorithm with decoding algorithm given by Reed et al. are given. This algorithm is suitable for implementation in a programmable microprocessor or special-purpose VLSI chip.

关键词： Quadratic Residue code unknown syndrome decoding algorithm cyclic code error pattern

作者: Tsung-Ching Lin Shao-I Chu Hsin-Chiu Chang Hung-Peng Lee

作者单位: Dept.of Information Engineering, I-Shou University Kaohsiung County, Taiwan

会议类型: 国际会议

会议名称: 第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)

会议地点: 南京

会议语种:英文

页码: 239-243

在线出版日期: 2009-07-25（万方平台首次上网日期，不代表论文的发表时间）