Polynomial of correctable patterns of product codes

Abstract

Product codes have a poor minimum distance, but an efficient low-complexity decoding algorithm. To measure the performance of a decoder, like Reddy-Robinson's for product codes, which decode error patterns beyond half the minimum distance, we use the notion of equivalent diameter of the decoding region [4]. We produce here a bound for the performance of product code which is, for the considered example, far below the simulated performance but still above the performance of known BCH codes with same parameters.<>