Stall Pattern Avoidance in Polynomial Product Codes

TL;DR

This paper introduces a novel low-complexity post-processing method for polynomial algebraic product codes, significantly reducing error floors in applications demanding extremely low bit-error rates.

Contribution

It proposes a new post-processing technique for polynomial product codes and provides theoretical bounds and simulation results demonstrating its effectiveness.

Findings

Error rate bounds are tight and achievable.

Post-processing improves error correction by orders of magnitude.

Method is low-complexity and practical for low-error applications.

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.