Weight Distribution and Bounds of Turbo-Code with 3 Dimensions

To evaluate the performance of the code, it is indispensable to know how to calculate the probability of error in decoding. The weight distribution and the enumerator polynomial input-output of the code are very useful in studying the probability of error that occurs when using a maximum likelihood decoding. In this paper, we are interested the performances of turbo-code 3 dimensional (TC-3D) when it is decoded on optimizing criterion the maximum likelihood. First, we determine the mean weight distribution and the enumerator polynomial input-output of this code, which provides an upper bound on its minimum distance. Then we deduce from this distribution the bound probability of error by bit and by word on the Gaussian channel