Skip to main content

Concatenated codes

  • Chapter
Codes and Turbo Codes

Part of the book series: Collection IRIS ((IRIS))

  • 1421 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Dvb-terrestrial. ETSI EN 302 296 V1.1.1 (2004–04).

    Google Scholar 

  2. P. Adde, R. Pyndiah, and C. Berrou. Performance of hybrid turbo codes. Elect. Letters, 32(24):2209–2210, Nov. 1996.

    Article  Google Scholar 

  3. 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.

    Article  MATH  MathSciNet  Google Scholar 

  4. 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.

    Google Scholar 

  5. D. J. C. MacKay. Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory, 45(2):399–431, March 1999.

    Article  MATH  MathSciNet  Google Scholar 

  6. K. R. Narayanan and G. L. Stüber. Selective serial concatenation of turbo codes. IEEE Comm. Letters, 1(5):136–139, Sept. 1997.

    Article  Google Scholar 

Download references

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics