Skip to main content

Part of the book series: Signals and Communication Technology ((SCT))

  • 287 Accesses

Abstract

Current communications systems cannot be conceived without error-correcting codes in their composition due to different propagation environments affected by disturbances (noise, fading, interference, etc.).

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • C. Berrou, A. Glavieux, P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: turbo-codes, in IEEE International Conference Communication (ICC), vol. 2 (Geneva, Switzerland, 1993), pp. 1064–1070

    Google Scholar 

  • R.C. Bose, D.K. Ray-Chaudhuri, Further results on error correcting binary group codes. Inf. Control 3(3), 279–290 (1960a)

    Article  MathSciNet  Google Scholar 

  • R.C. Bose, D.K. Ray-Chaudhuri, On a class of error correcting binary group codes. Inf. Control 3(1), 68–79 (1960b)

    Article  MathSciNet  Google Scholar 

  • P. Elias, Coding for noisy channels. IRE Int. Conv. Rec. 3, 37–46 (1955)

    Article  Google Scholar 

  • R.W. Hamming, Error detecting and correcting codes. Bell Syst. Tech. J. 29(2), 147–160 (1950)

    Article  MathSciNet  Google Scholar 

  • A. Hocquenghem, Codes correcteurs d’Erreurs. Chiffres 2, 147–160 (1959)

    MathSciNet  MATH  Google Scholar 

  • I.S. Reed, G. Solomon, Polynomial codes over certain finite fields. SIAM J. Appl. Math. 8, 300–304 (1960)

    Article  MathSciNet  Google Scholar 

  • C.E. Shannon, A mathematical theory of communications. Bell Syst. Tech. J. 27(3), 379–423 (1948a)

    Article  MathSciNet  Google Scholar 

  • C.E. Shannon, A mathematical theory of communications. Bell Syst. Tech. J. 27(4), 623–656 (1948b)

    Article  MathSciNet  Google Scholar 

  • O.Y. Takeshita, Permutation polynomial interleavers: an algebraic-geometric perspective. IEEE Trans. Inf. Theory 53(6), 2116–2132 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lucian Trifina .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Trifina, L., Tarniceriu, D. (2019). Introduction. In: Permutation Polynomial Interleavers for Turbo Codes. Signals and Communication Technology. Springer, Singapore. https://doi.org/10.1007/978-981-13-2625-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2625-7_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2624-0

  • Online ISBN: 978-981-13-2625-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics