Article

Algebraic Decoding of the Quadratic Residue Code

IEEE Transactions on Information Theory (Impact Factor: 2.65). 11/2008; 54(11):5005-5011. DOI: 10.1109/TIT.2008.929956
Source: DBLP

ABSTRACT 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.

0 Followers
 · 
46 Views
  • Source
    IEEE Transactions on Communications 01/2013; · 1.98 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Recently, the unified unknown syndrome representations to decode a class of binary cyclic codes have been developed by using Lagrange interpolation formula (discussed by Chang and Lee in 2010). In this study, a new method by combining the syndrome matrix search and modified Chinese remainder theorem is proposed to express the unified unknown syndrome representation as a rational function in terms of the known syndromes. A computer simulation has been executed to determine the syndrome matrices for binary cyclic codes of lengths less than or equal to 51. Compared to the Lagrange interpolation method, the method presented here substantially reduces the computational time for binary cyclic codes generated by irreducible polynomials. Finally, a complete decoding of the (31, 16, 7) quadratic residue code with inverse-free Berlekamp-Massey algorithm is given as an illustration.
    IET Communications 12/2012; 6(18):3339-3349. DOI:10.1049/iet-com.2012.0180 · 0.72 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, an explicit expression of the weak-locator polynomial for p-ary quadratic residue codes is presented by a modification of the Feng-Tzeng matrix method. The differences between the modified version and the original Feng-Tzeng matrix are that in the new matrix, not every entry is a syndrome, and every syndrome entry is a known syndrome. By utilizing this technique, an algebraic decoding of the ternary (61, 30, 12) quadratic residue code is proposed. This new result has never been seen in the literature to our knowledge. An advantage of the proposed decoding algorithm is that in general the obtained weak-locator polynomials can decode efficiently not only all the error patterns of weights four and five, but also some error patterns of weight six.
    IEEE Transactions on Information Theory 03/2015; 61(3):1-1. DOI:10.1109/TIT.2015.2388753 · 2.65 Impact Factor