By Topic

Algebraic decoding of the (73, 37, 13) quadratic residue code

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
H. -P. Lee ; Department of Computer Science and Information Engineering, Fortune Institute of Technology, Kaohsiung 83160, Taiwan ; H. -C. Chang ; T. -K. Truong

In this study, an efficient and fast algebraic decoding algorithm (ADA) for the binary systematic quadratic residue (QR) code of length 73 with the reducible generator polynomial to correct up to six errors is proposed. The S(I, J) matrix method given by He et al. (2001) is utilised to compute the unknown syndromes S5. A technique called swap base is proposed to correct the weight-4 error patterns. To correct the weight-5 error patterns, the new error-locator polynomials for decoding the five errors are derived. Finally, the modified shift-search algorithm (SSA) developed by Lin et al. (2010) is applied to correct the weight-6 error patterns. Moreover, the computations of all syndromes are achieved in a small finite field. Simulation results show that the proposed ADA is practical.

Published in:

IET Communications  (Volume:6 ,  Issue: 10 )