Article citationsMore >>

Chen, Y.H., Chien, C.H., Huang, C.H., Truong, T.K., and Jing, M.H., “Efficient decoding of systematic (23, 12, 7) and (41, 21, 9) quadratic residue codes,” J. Inform. Sci. and Eng., 26(5). 1831-1843. Sept. 2010.

has been cited by the following article:

Article

Decoding of the Triple-Error-Correcting Binary Quadratic Residue Codes

1Department of Computer Science and Information Engineering, Fortune Institute of Technology, Kaohsiung, ROC


Automatic Control and Information Sciences. 2014, Vol. 2 No. 1, 7-12
DOI: 10.12691/acis-2-1-2
Copyright © 2014 Science and Education Publishing

Cite this paper:
Hung-Peng Lee, Hsin-Chiu Chang. Decoding of the Triple-Error-Correcting Binary Quadratic Residue Codes. Automatic Control and Information Sciences. 2014; 2(1):7-12. doi: 10.12691/acis-2-1-2.

Correspondence to: Hung-Peng  Lee, Department of Computer Science and Information Engineering, Fortune Institute of Technology, Kaohsiung, ROC. Email: hpl@fotech.edu.tw

Abstract

In this paper, a more efficient syndrome-weight decoding algorithm (SWDA), called the enhanced syndrome-weight decoding algorithm (ESWDA), is presented to decode up to three possible errors for the binary systematic (23, 12, 7) and (31, 16, 7) quadratic residue (QR) codes. In decoding of the QR codes, the evaluation of the error-locator polynomial in the finite field is complicated and time-consuming. To solve such a problem, the proposed ESWDA avoids evaluating the complicated error-locator polynomial, and has no need of a look-up table to store the syndromes and their corresponding error patterns in the memory. In comparison with the SWDA developed by Lin-Chang-Lee-Truong (2010), the simulation results show that the ESWDA can serve as an efficient and high-speed decoder.

Keywords