Skip to main content

Robust VL Codes

  • 2929 Accesses

Abstract

The many codes included in this chapter have a common feature; thet are robust. Any errors that creep into a string of such codewords can either be detected (or even corrected automatically) or have only limited effects and do not propagate indefinitely. The chapter starts with a discussion of the principles of error-control codes.

Keywords

  • Data Symbol
  • Symmetric Pattern
  • Code Tree
  • Complete Binary Tree
  • Codeword Length

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-1-84882-903-9_4
  • Chapter length: 33 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   149.00
Price excludes VAT (USA)
  • ISBN: 978-1-84882-903-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Salomon .

Rights and permissions

Reprints and Permissions

Copyright information

© 2010 Springer-Verlag London

About this chapter

Cite this chapter

Salomon, D., Motta, G. (2010). Robust VL Codes. In: Handbook of Data Compression. Springer, London. https://doi.org/10.1007/978-1-84882-903-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-903-9_4

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-902-2

  • Online ISBN: 978-1-84882-903-9

  • eBook Packages: Computer ScienceComputer Science (R0)