Unveiling turbo codes: some results on parallel concatenated coding schemes
IEEE Transactions on Information Theory
Code construction and decoding of parallel concatenated tail-biting codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
An algorithm for the low-weight determination of parallel concatenated Bose Ray Chaudhuri Hocquenghem (BCH) codes is presented. It is basically conducted by recognizing patterns that generate low weights for the constituent BCH codes. The algorithm is simple and can be applied for codes having high rate and long interleaver length. For codes constructed by row-column and pseudo random interleavers, the upper bound of probability of error is computed. It agrees with simulation results in the error floor region.