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.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A general result on the explicit form of the general error locator polynomial for all cyclic codes is given, along with several specific results for classes of cyclic codes. From these, a theoretically justification of the sparsity of the general error locator polynomial is obtained for all cyclic codes with $t\leq 3$ and $n<63$, except for three cases.
  • [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
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper1, a method to search the subsets I and J needed in computing the unknown syndromes for the (73, 37, 13) quadratic residue (QR) code is proposed. According to the resulting I and J, one computes the unknown syndromes, and thus finds the corresponding error-locator polynomial by using an inverse-free BM algorithm. Based on the modified Chase-II algorithm, the performance of soft-decision decoding for the (73, 37, 13) QR code is given. This result is never seen in the literature, to our knowledge. Moreover, the error-rate performance of linear programming (LP) decoding for the (73, 37, 13) QR code is also investigated, and LP-based decoding is shown to be significantly superior in performance to the algebraic soft-decision decoding while requiring almost the same computational complexity.
    ICC 2014 - 2014 IEEE International Conference on Communications; 06/2014