Abstract
While parity checks are useful for low data rates and asynchronous messages where large gaps in between successive bytes make compilation of data into block impossible, for more general protection of data a much more robust error detection scheme is necessary. The cyclic redundancy check or CRC is one such mechanism and it requires that the data are divided into blocks, hence it is termed a block code. As with many block codes the CRC is based on finite field theory which need not concern us greatly, except that there are a few ground rules which must be understood.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 A.D. Houghton
About this chapter
Cite this chapter
Houghton, A.D. (1997). Cyclic redundancy checking. In: The Engineer’s Error Coding Handbook. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0447-0_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0447-0_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-412-79070-6
Online ISBN: 978-1-4613-0447-0
eBook Packages: Springer Book Archive