A method to reduce the decoding complexity of the binary (89, 45, 17) quadratic residue code
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 2
Syndrome-weight decoder for general binary quadratic residue codes
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Algebraic decoding of a class of binary cyclic codes via Lagrange interpolation formula
IEEE Transactions on Information Theory
Hi-index | 754.90 |
Recently, an algebraic decoding algorithm suggested by Truong (2005) for some quadratic residue codes with irreducible generating polynomials has been designed that uses the inverse-free Berlekamp-Massey (BM) algorithm to determine the error-locator polynomial. In this paper, based on the ideas of the algorithm mentioned above, an algebraic decoder for the (89, 45, 17) binary quadratic residue code, the last one not decoded yet of length less than 100 , is proposed. It was also verified theoretically for all error patterns within the error-correcting capacity of the code. Moreover, the verification method developed in this paper can be extended for all cyclic codes without checking all error patterns by computer simulations.