Title :
Algebraic and linear programming decoding of the (73, 37, 13) quadratic residue code
Author :
Yong Li ; Hongqing Liu ; Qianbin Chen ; Trieu-Kien Truong
Author_Institution :
Chongqing Key Lab. of Mobile Commun. Technol., Chongqing Univ. of Posts & Telecommun., Chongqing, China
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.
Keywords :
algebraic codes; computational complexity; decoding; linear programming; residue codes; Chase-II algorithm; algebraic soft decision decoding; computational complexity; error-locator polynomial; inverse-free Berlekamp-Massey algorithm; linear programming decoding; quadratic residue code; Approximation algorithms; Computational complexity; Linear programming; Maximum likelihood decoding; Polynomials; Silicon; Berlekamp-Massey algorithm; Chase algorithm; linear programming; quadratic residue code;
Conference_Titel :
Communications (ICC), 2014 IEEE International Conference on
Conference_Location :
Sydney, NSW
DOI :
10.1109/ICC.2014.6883619