A method to reduce the decoding complexity of the binary (89, 45, 17) quadratic residue code

In order to use Berlekamp-Massey algorithm to decode the (89, 45, 17) binary quadratic residue code, one needs to determine two primary unknown syndromes. In this paper, the authors give some syndrome matrices, so as to calculate one primary unknown syndrome efficiently. This results in a reduction of decoding complexity in terms of CPU time by 35% at least versus the decoder proposed by Truong et al.