Open AccessAlgebraic decoding of the (71, 36, 11) quadratic residue code
Author(s) -
Lin TsungChing,
Chang HsinChiu,
Li Yong,
Chang Jack,
Truong TrieuKien
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2015.0159
Subject(s) - decoding methods , computer science , quadratic residue , algorithm , binary number , berlekamp–welch algorithm , binary symmetric channel , list decoding , algebraic number , quadratic equation , error detection and correction , sequential decoding , code (set theory) , software , low density parity check code , arithmetic , mathematics , concatenated error correction code , block code , mathematical analysis , geometry , set (abstract data type) , programming language
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.