Skip to main content

The Mutations of Convolutional Coding (Around the Trellis)

  • Chapter
Codes, Graphs, and Systems

Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 670))

  • 290 Accesses

Abstract

In years past, it was somewhat difficult to make up one’s mind about the multiple types of error correcting coding schemes, which were categorized mainly into convolutional or block codes, with many variations in each family. Are there such great differences between all these codes? Without giving formal answers, this short paper translates a personal opinion that was initially conceived thanks to the ideas of Dave Forney.

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 PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.00
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Elias, “Error-Free Coding,” IRE Transactions on Information Theory, vol. PGIT-4, pp. 29–37, Sept. 1954.

    MathSciNet  Google Scholar 

  2. G. Ungerboeck, “Channel Coding With Multilevel/Phase Signals,” IEEE Transactions on Information Theory, vol. IT-28, pp. 55–67, Jan. 1982.

    Article  Google Scholar 

  3. C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes,” Proceedings of the IEEE International Conference on Communications 1993, Geneva, pp. 1064–1070, May 1993.

    Google Scholar 

  4. G. D. Forney, “The Viterbi Algorithm,” Proceedings of the IEEE, vol. 61, no. 3, pp. 268–278, Mar. 1973.

    Article  MathSciNet  Google Scholar 

  5. [5] A. R. Calderbank, G. D. Forney, and A. Vardy, reported in Fundamentals of Convolutional Coding, (R. Johannesson and K. S. Zigangirov), pp. 227–228, IEEE Press, 1999.

    Google Scholar 

  6. C. Berrou, C. Douillard, and M. Jézéquel, “Multiple Parallel Concatenation of Circular Recursive Systematic Convolutional (CRSC) Codes,” Annales des Télécommunication, tome 54, no. 3-4, pp. 166–172, Mar–April 1999.

    Google Scholar 

  7. R. G. Gallager, “Low-Density Parity-Check Codes,” IRE Transactions on Information Theory, vol. IT-8, pp. 21–28, Jan. 1962.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Berrou, C. (2002). The Mutations of Convolutional Coding (Around the Trellis). In: Blahut, R.E., Koetter, R. (eds) Codes, Graphs, and Systems. The Kluwer International Series in Engineering and Computer Science, vol 670. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0895-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0895-3_1

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5292-1

  • Online ISBN: 978-1-4615-0895-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics