Fast CRCs

Abstract

CRCs have desirable properties for effective error detection. But their software implementation, which relies on many steps of the polynomial division, is typically slower than other codes such as weaker checksums. A relevant question is whether there are some particular CRCs that have fast implementation. In this paper, we introduce such fast CRCs as well as an effective technique to implement them. For these fast CRCs, even without using table lookup, it is possible either to eliminate or to greatly reduce many steps of the polynomial division during their computation.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 2009
Accession Number
ADA521322

Entities

People

  • Gam D. Nguyen

Organizations

  • United States Naval Research Laboratory

Tags

DTIC Thesaurus Topics

  • Algorithms
  • C Programming Language
  • Coding
  • Communication Systems
  • Computational Complexity
  • Computations
  • Computer Languages
  • Computer Programming
  • Computer Programs
  • Computers
  • Computing System Architectures
  • Detection
  • Electronic Mail
  • Error Detection Codes
  • Language
  • Notation
  • Programming Languages

Fields of Study

  • Computer science

Readers

  • Cybersecurity.
  • Gender and Food Studies
  • Operations Research