Construct · 1 fields · 1 citations

cyclic redundancy check: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
cyclicredundancy check1 CONSTRUCTCyclic redundancy checkPETERSON · CODING THEORY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Coding theory

error detection by appending the remainder of polynomial division of the data, which catches burst errors cheaply.

In coding theory, cyclic redundancy check refers to error detection by appending the remainder of polynomial division of the data, which catches burst errors cheaply. This meaning comes from Peterson (1961) in Proceedings of the IRE.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how cyclic redundancy check sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

check1 fields · 1 citationsanchor · a standalone constructdivision4 fields · 7 citationsjingle · one word, four constructserror4 fields · 8 citationsjingle · one word, four constructs

References

  1. Peterson, W., & Brown, D. (1961). Cyclic Codes for Error Detection. Proceedings of the IRE, 49(1), 228-235. https://doi.org/10.1109/jrproc.1961.287814

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct