High-rate serially concatenated codes using hamming codes

This paper studies (very) high-rate serially concatenated codes employing rate-1 recursive convolutional encoders and Hamming codes. We show that these codes exhibit capacity-approaching performance by the EXIT chart analysis and simulations, and that they outperform many known codes of similar parameters with respect to error rates. The serially concatenated codes can be decoded with (relatively) low complexity, and have large flexibility in code lengths and code rates.