Turbo code performance as a function of code block size

Abstract

We show that a single family of turbo codes is "nearly perfect" with respect to Shannon's (1959) sphere-packing bound, over a wide range of code rates and block sizes. We also assess the "imperfectness" of various non-turbo codes for comparison,.