An improvement on decoding of the binary systematic (47, 24, 11) quadratic residue code

摘要：

An improved algebraic decoding algorithm (ADA) is presented to decode up to five possible errors in a binary systematic (47, 24, 11) quadratic residue (QR) code. The main idea of the improved ADA is to find out the new conditions in fourerror and fiveerror cases and the smallest degree of the unknown syndrome polynomial in fiveerror case. Thus, the computational complexity in the finite field can be reduced. A simulation result shows that the decoding speed of the proposed ADA is faster than other existing ADAs.

关键词： algebraicdecodingalgorithm quadraticresidue codes error locator polynomial syndrome

作者: Hung-Peng Lee Hsin-Chiu Chang

作者单位: Department of Computer Science and InformationEngineeringFortune Institute of TechnologyKaohsiung Ci Department of Communication Engineering Xiamen University Xiamen, China

会议类型: 国际会议

会议名称: 2011 International Conference on Business Management and Electronic Information(2011商业管理与电子信息国际学术会议 BMEI2011)

会议地点: 广州

会议语种:英文

页码: 1-4

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