Title :
Union bounds on the performance of product codes
Author :
Tolhuizen, Ludo ; Baggen, Stan ; Hekstra-Nowacka, Ewa
Author_Institution :
Philips Res. Lab., Eindhoven, Netherlands
Abstract :
We estimate the weight enumerator of a product code by using an exact expression for its known terms (e.g., the number of low weight words), and a binomial approximation for its unknown terms. We subsequently apply a union bound, using the estimated weight enumerator, to large product codes. The computed union bounds are similar to the simulation results of iterative (turbo) decoding of such codes as reported in literature
Keywords :
binary codes; binomial distribution; block codes; linear codes; binary linear code; binomial approximation; exact expression; iterative turbo decoding; known terms; product codes; union bounds; unknown terms; weight enumerator estimation; AWGN channels; Additive white noise; Binary phase shift keying; Chromium; Gaussian noise; Iterative decoding; Laboratories; Linear code; Modulation coding; Product codes;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708872
