On the performance of integrated interleaving coding schemes

We examine the performance of integrated interleaving coding schemes given by Hassner et al. (2001). We show that the originally proposed bounds are fairly loose, which in specific cases actually suggests a worsening in the performance using the code. A tighter theoretical evaluation of the performance is presented and based on it, closed-form analytical expressions are derived to optimize the performance within a given class of codes. We then present a modified decoding scheme of the code and evaluate its performance to show that it substantially improves the coding gain compared to the original decoding scheme.