Algebraic decoding of the (71, 36, 11) quadratic residue code

Algebraic decoding of the (71, 36, 11) quadratic residue code

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In this study, a new approach is developed to facilitate faster decoding of a binary systematic (71, 36, 11) quadratic residue (QR) code. In this decoder, it simplifies the step of calculating the condition and avoids calculating the unknown syndrome, thereby yielding a fast algebraic decoder for correcting four possible errors. Moreover, while using the proposed algorithm, if uses the channel measurement information proposed by Chase to sequentially invert the bits of the received word until one of the errors is cancelled for the five-error case and apply the new algebraic decoding algorithm mentioned above to correct the remaining four errors, the algorithm has been verified through a software simulation in C-language. The simulation shows that the decoding scheme developed here is more efficient than the previous decoding algorithm developed for the (71, 36, 11) QR code and it is naturally suitable for software implementation.

Related content

This is a required field
Please enter a valid email address