Title :
An improvement on decoding of the binary systematic (47, 24, 11) quadratic residue code
Author :
Lee, Hung-Peng ; Chang, Hsin-Chiu
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Fortune Inst. of Technol., Kaohsiung, Taiwan
Abstract :
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 four-error and five-error cases and the smallest degree of the unknown syndrome polynomial in five-error 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.
Keywords :
binary codes; computational complexity; decoding; polynomials; residue codes; algebraic decoding algorithm; binary systematic code; computational complexity; quadratic residue code; unknown syndrome polynomial; Computational complexity; Decoding; Delay; Generators; Polynomials; Simulation; Systematics; algebraic decoding algorithm; error locator polynomial; quadratic residue codes; syndrome;
Conference_Titel :
Business Management and Electronic Information (BMEI), 2011 International Conference on
Conference_Location :
Guangzhou
Print_ISBN :
978-1-61284-108-3
DOI :
10.1109/ICBMEI.2011.5917066
