A novel approach for evaluating the performance of SPC productcodes under erasure decoding

Abstract

Product codes are powerful codes that can be used to correct errors or recover erasures. The simplest form of a product code is that where every row and every column is terminated by a single parity bit, referred to as single parity check (SPC) product code. This code has a minimum distance of four and is thus guaranteed to recover all single, double, and triple erasure patterns. Judging the code performance based on its minimum distance is very pessimistic because the code is actually capable of recovering many higher erasure patterns. This paper develops a novel approach for deriving an upper bound on the post-decoding erasure rate for the SPC product code with iterative decoding. Simulation shows that the derived bound is very tight