Skip to main content
SpringerLink
Log in
Book cover

Communications and Cryptography pp 201–207Cite as

A Comparison of Error Patterns Corrected By Block Codes and Convolutional Codes

  • Chapter

  • 282 Accesses

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

Abstract

The purpose of this paper is to suggest that when a fair comparison of a block code and a convolutional code is made, which means that good codes with the same rate and distance are compared, the performance is almost the same. However, the convolutional code has a small advantage which is directly related to the structure of the code.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.L. Massey, “Theory and practice of error control codes”, (book review), IEEE Trans. Info. Th., IT-31, pp. 553–554, 1985.

    Article  MathSciNet  Google Scholar 

  2. J.L. MasseySome algebraic and distance properties of convolutional codesin H.B. Mann (Ed.):Error Correcting Codespp. 89–110, Wiley, New York, 1968.

    Google Scholar 

  3. A.J. Viterbi, “Convolutional codes and their performance in communication systems”IEEE Trans. Commun. Tech.COM-19, pp. 751–772, 1971.

    Article  MathSciNet  Google Scholar 

  4. V.V. Zyablov and V.R. Sidorenko,“Bounds on the complexity of trellis decoding oflinear block codes”, to appear inProblemy Peredachi Informatsii.

    Google Scholar 

  5. J. Justesen, “Bounded distance decoding of unit memory codes”IEEE Trans. Info. Th.IT-39, 1993.

    Google Scholar 

  6. C. Thommesen and J. Justesen, “Bounds on distances and error exponents of unit memory codes”IEEE Trans. Info. Th.IT-29,pp. 637–649, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Circuit Theory and Telecommunications, Technical University of Denmark, Denmark, Europe

    J. Justesen

Authors
  1. J. Justesen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Illinois, USA

    Richard E. Blahut

  2. University of Notre Dame, France

    Daniel J. Costello Jr.

  3. ETH Zurich, Switzerland

    Ueli Maurer

  4. University of California, San Diego, USA

    Thomas Mittelholzer

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media New York

About this chapter

Cite this chapter

Justesen, J. (1994). A Comparison of Error Patterns Corrected By Block Codes and Convolutional Codes. In: Blahut, R.E., Costello, D.J., Maurer, U., Mittelholzer, T. (eds) Communications and Cryptography. The Springer International Series in Engineering and Computer Science, vol 276. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2694-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2694-0_20

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6159-6

  • Online ISBN: 978-1-4615-2694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation