Approach for deriving performance bounds of punctured turbo codes

The average upper bound for punctured turbo codes is derived from knowledge of the conditional weight enumerating function of the original low-rate code. A novel approach to generating these bounds, hypergeometric puncturing, is introduced, which enables the performance to be averaged over all possible puncturing positions at a required code rate