Skip to main content

Block Codes

  • Chapter
Turbo Codes

Abstract

The encoder of an (n, k) block code accepts a message of k symbols and transforms it into a longer sequence of n symbols called a codeword. The important feature of a block code is that a codeword depends only on the current input message and not on the past messages. That is, the encoder is a memoryless device. In general, both messages and codewords can consist of nonbinary symbols. However, block codes with binary symbols are most often used due to implementation complexity constraints.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. J. M. Wozencraft, and I. M. Jacobs, “Principles of Communication Engineering” John Wiley, 1965.

    Google Scholar 

  2. R. G. Gallager, “Information Theory and Reliable Communications” John Wiley, 1968.

    Google Scholar 

  3. J. G. Proakis, “Digital Communications”, 2nd Ed. McGraw-Hill, New York, 1989.

    Google Scholar 

  4. S. Lin, and D. J. Costello, Jr., “Error Control Coding: Fundamentals and Applications”, Prentice-Hall, 1983.

    Google Scholar 

  5. E. R. Berlekamp, “Algebraic Coding Theory”, McGraw-Hill, 1968.

    Google Scholar 

  6. R. Blahut, “Theory and Practice of Error Control Codes”, Adison-Wesley Publishing Company, 1983.

    Google Scholar 

  7. A. J. Viterbi, and J. K. Omura, “Principles of Digital Communication and Coding”, McGraw-Hill, New York, 1979.

    MATH  Google Scholar 

  8. L. R. Bahl, J. Cocke, F. Jelinek and J. Raviv, ”Optimum Decoding of Linear Codes for Minimizing Symbol Error Rate“, IEEE Trans. Inform. Theory, vol. IT-13, 1974, pp. 284–287.

    Article  MathSciNet  Google Scholar 

  9. J. K. Wolf, “Efficient Maximum Likelihood Decoding of Linear Block Codes”, IEEE Trans. Inform. Theory, vol. IT-24, Jan. 1978, pp. 76–80.

    Article  Google Scholar 

  10. G. D. Forney, Jr., “Coset Codes-Part II: Binary Lattices and Related Codes”, IEEE Trans. Inform. Theory, vol. 34, Sep. 1988, pp. 1152–1187.

    Article  MathSciNet  Google Scholar 

  11. R. J. McEiece, “On the BCJR Trellis for Linear Block Codes”, IEEE Trans. Inform. Theory, vol. 42, No. 4, July 1996.

    Google Scholar 

  12. H. Imai, “Essentials of Error-Control Coding Techniques”, Academic Press, 1990.

    Google Scholar 

  13. D. Chase, “A Class of Algorithms for Decoding Block Codes with Channel Measurement Information”, IEEE Trans. Inform. Theory, vol. IT-18, Jan. 1972, pp. 170–182.

    Article  MathSciNet  Google Scholar 

  14. S. Benedetto and G. Montorsi, “Unveiling turbo-codes: Some results on parallel concatenated coding schemes,” IEEE Trans. Inform. Theory, vol. 42, no. 2, Mar. 1996, pp. 409–428.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Vucetic, B., Yuan, J. (2000). Block Codes. In: Turbo Codes. The Springer International Series in Engineering and Computer Science, vol 559. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4469-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-4469-2_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7013-0

  • Online ISBN: 978-1-4615-4469-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics