Randomly interleaved single parity check product codes

This paper considers single parity check (SPC) product codes which are randomly interleaved between the dimensions of the code. The aim of the random interleaving is to reduce the number of codewords at minimum distance and potentially improve the minimum distance of the code. The performance is significantly improved with a three or more dimensional interleaved SPC product code.

[1]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[2]  T. A. Gulliver,et al.  Asymptotic performance of product codes , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[3]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[4]  Peter Elias,et al.  Error-free Coding , 1954, Trans. IRE Prof. Group Inf. Theory.

[5]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[6]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.