• DOI:10.1109/DSN.2004.1311885
Corpus ID: 793862

Cyclic redundancy code (CRC) polynomial selection for embedded networks

@article{Koopman2004CyclicRC,
  title={Cyclic redundancy code (CRC) polynomial selection for embedded networks},
  author={P. Koopman and T. Chakravarty},
  journal={International Conference on Dependable Systems and Networks, 2004},
  year={2004},
  pages={145-154}
}

P. Koopman, T. Chakravarty

Published 2004

Computer Science

International Conference on Dependable Systems and Networks, 2004

Cyclic redundancy codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many commonly used CRC polynomials provide significantly less error detection capability than they might. An exhaustive exploration reveals that most previously published CRC polynomials are either inferior to alternatives or are only good choices for particular message lengths. Unfortunately these shortcomings and limitations often seem to be overlooked. This paper describes… CONTINUE READING

View on IEEE

users.ece.cmu.edu

Save to Library

Create Alert

Cite

Launch Research Feed