built from fixed convolutional codes interconnected with random interleavers. We call these
systems “turbo-like” codes and they include as special cases both the classical turbo codes
[1, 2, 3] and the serial concatentation of interleaved convolutional codes [4]. We offer a
general conjecture about the behavior of the ensemble (maximum-likelihood decoder) word
error probability as the word length approches infinity. We prove this conjecture for a simple …