Name
Abstract | ||
|---|---|---|
Product codes are a concatenated error-correction scheme that has been often considered for applications requiring very low bit-error rates, which demand that the error floor be decreased as much as possible. In this work, we consider product codes constructed from polynomial algebraic codes, and propose a novel low-complexity post-processing technique that is able to improve the error-correction performance by orders of magnitude. We provide lower bounds for the error rate achievable under post processing, and present simulation results indicating that these bounds are tight. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/GlobalSIP.2016.7905932 | 2016 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP) |
DocType | Volume | ISSN |
Conference | abs/1611.04834 | 2376-4066 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlo Condo | 1 | 132 | 21.40 |
| François Leduc-Primeau | 2 | 15 | 6.73 |
| Gabi Sarkis | 3 | 253 | 17.23 |
| Pascal Giard | 4 | 244 | 17.57 |
| Warren J. Gross | 5 | 1106 | 113.38 |