Stall Pattern Avoidance in Polynomial Product Codes
Information Theory
2017-09-26 v1 Signal Processing
math.IT
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.
Cite
@article{arxiv.1611.04834,
title = {Stall Pattern Avoidance in Polynomial Product Codes},
author = {Carlo Condo and Francois Leduc-Primeau and Gabi Sarkis and Pascal Giard and Warren Gross},
journal= {arXiv preprint arXiv:1611.04834},
year = {2017}
}
Comments
4 pages, 2 figures, GlobalSiP 2016