An upper bound on turbo code free distance

An upper bound on the free distance of turbo codes is developed by treating the codes as linear block codes and exploiting properties of the resulting generator matrix. The free distance upper bound is then used to lower bound the performance of turbo codes.

[1]  S. S. Pietrobon,et al.  Terminating the trellis of turbo-codes in the same state , 1995 .

[2]  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.

[3]  Patrick Robertson,et al.  Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[4]  Dariush Divsalar,et al.  Turbo codes for PCS applications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[5]  W. J. Blackert,et al.  TURBO CODE TERMINATION AND INTERLEAVER CONDITIONS , 1995 .