Cyclic redundancy code (CRC) polynomial selection for embedded networks
Top Cited Papers
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 145-154
- https://doi.org/10.1109/dsn.2004.1311885
Abstract
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 a polynomial selection process for embedded network applications and proposes a set of good general-purpose polynomials. A set of 35 new polynomials in addition to 13 previously published polynomials provides good performance for 3- to 16-bit CRCs for data word lengths up to 2048 bits.Keywords
This publication has 6 references indexed in Scilit:
- 32-bit cyclic redundancy codes for Internet applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- RObust Header Compression (ROHC): Framework and four profiles: RTP, UDP, ESP, and uncompressedPublished by RFC Editor ,2001
- Fast calculation of the number of minimum-weight words of CRC codesIEEE Transactions on Information Theory, 2001
- Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancyIEE Proceedings - Communications, 2000
- On the cyclic redundancy-check codes with 8-bit redundancyComputer Communications, 1998
- Optimization of cyclic redundancy-check codes with 24 and 32 parity bitsIEEE Transactions on Communications, 1993