Abstract
The previous chapters presented the elementary laws of encoding like BCH, Reed-Solomon or CRSC codes. Most of these elementary codes are asymptotically good, in the sense that their minimum Hamming distances (MHD) can be made as large as we want, by sufficiently increasing the degree of the generator polynomials. The complexity of the decoders is unfortunately unacceptable for the degrees of polynomials that would guarantee the MHD required by practical applications.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Bibliography
Dvb-terrestrial. ETSI EN 302 296 V1.1.1 (2004–04).
P. Adde, R. Pyndiah, and C. Berrou. Performance of hybrid turbo codes. Elect. Letters, 32(24):2209–2210, Nov. 1996.
S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara. Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding. IEEE Trans. Info. Theory, 44(3):909–926, May 1998.
Jr. G. D. Forney. Performance of concatenated codes. In E. R. Berlekamp, editor, Key papers in the development of coding theory, pages 90–94. IEEE Press, 1974.
D. J. C. MacKay. Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory, 45(2):399–431, March 1999.
K. R. Narayanan and G. L. Stüber. Selective serial concatenation of turbo codes. IEEE Comm. Letters, 1(5):136–139, Sept. 1997.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag France, Paris
About this chapter
Cite this chapter
(2010). Concatenated codes. In: Berrou, C. (eds) Codes and Turbo Codes. Collection IRIS. Springer, Paris. https://doi.org/10.1007/978-2-8178-0039-4_6
Download citation
DOI: https://doi.org/10.1007/978-2-8178-0039-4_6
Publisher Name: Springer, Paris
Print ISBN: 978-2-8178-0038-7
Online ISBN: 978-2-8178-0039-4
eBook Packages: Computer ScienceComputer Science (R0)