Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ICC.2014.6883619 | ICC |
Keywords | Field | DocType |
chase-ii algorithm,inverse-free berlekamp-massey algorithm,quadratic residue code,linear programming decoding,residue codes,linear programming,computational complexity,chase algorithm,algebraic codes,error-locator polynomial,berlekamp-massey algorithm,decoding,algebraic soft decision decoding,approximation algorithms,polynomials,berlekamp massey algorithm,silicon | Quadratic residue code,Berlekamp–Welch algorithm,Algebraic number,Sequential decoding,Algebra,Computer science,Linear programming decoding,Real-time computing,Theoretical computer science,List decoding,Criss-cross algorithm | Conference |
ISSN | Citations | PageRank |
1550-3607 | 0 | 0.34 |
References | Authors | |
14 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yong Li | 1 | 0 | 0.68 |
| Hongqing Liu | 2 | 45 | 28.77 |
| Chen Qian-bin | 3 | 4 | 1.81 |
| Trieu-Kien Truong | 4 | 0 | 0.34 |