1971Unpublished venueRequires access

A multi-channel CRC register

Arvind M. Patel

Open publisher page 21 citations

Abstract

The Cyclic Redundancy Check (CRC) is extremely efficient and well suited for error detection in transmission, retrieval or storage of variable length records of binary data. The cyclic check is capable of detecting nearly all patterns of error with almost negligible amount of redundancy. For example, a 16-digit (2 bytes) CRC character will detect all error-bursts of length 16 or less and better than 99.99 percent of all other error-bursts in binary records of any length. For average record length of 1000 bytes this amounts to less than 0.2 percent redundancy. Peterson and Brown's paper is an excellent exposition on the subject of error detection with cyclic codes.

About this research paper

What this paper is about

The Cyclic Redundancy Check (CRC) is extremely efficient and well suited for error detection in transmission, retrieval or storage of variable length records of binary data. The cyclic check is capable of detecting nearly all patterns of error with almost negligible amount of redundancy. For example, a 16-digit (2 bytes) CRC character will detect all error-bursts of length 16 or less and better than 99.99 percent of all other error-bursts in binary records of any length. For average record length of 1000 bytes this amounts to less than 0.2 percent redundancy. Peterson and Brown's paper is an excellent exposition on the subject of error detection with cyclic codes.

Why it matters

OpenAlex reports 21 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The Cyclic Redundancy Check (CRC) is extremely efficient and well suited for error detection in transmission, retrieval or storage of variable length records of binary data. The cyclic check is capable of detecting nearly all patterns of error with almost negligible amount of redundancy. For example, a 16-digit (2 bytes) CRC character will detect all error-bursts of length 16 or less and better than 99.99 percent of all other error-bursts in binary records of any length. For average record length of 1000 bytes this amounts to less than 0.2 percent redundancy. Peterson and Brown's paper is an excellent exposition on the subject of error detection with cyclic codes.

Key concepts: Byte, Cyclic redundancy check, Redundancy (engineering), Computer science, Error detection and correction, Binary number, Algorithm, Decoding methods

Related papers

Back to paper searchBrowse research topicsOriginal source
A multi-channel CRC register — Research Paper | ScholarLens