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} }
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
Figures, Tables, and Topics from this paper
340 Citations
Efficient High Hamming Distance CRCs for Embedded Networks
- Computer Science
- International Conference on Dependable Systems and Networks (DSN'06)
- 2006
- 44
- PDF
Coverage and the use of cyclic redundancy codes in ultra-dependable systems
- Computer Science
- 2005 International Conference on Dependable Systems and Networks (DSN'05)
- 2005
- 44
- PDF
Joint optimum message length and generator polynomial selection in cyclic redundancy check (CRC) coding
- Computer Science
- 2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU)
- 2011
- 4
A sieving method for the optimization of embedded CRC codes
- Computer Science
- 2012 IEEE International Conference on Information Science and Technology
- 2012
- 1
Generalized parallel CRC computation on FPGA
- Computer Science
- 2015 IEEE 28th Canadian Conference on Electrical and Computer Engineering (CCECE)
- 2015
- 8
References
SHOWING 1-10 OF 28 REFERENCES
32-bit cyclic redundancy codes for Internet applications
- Computer Science
- Proceedings International Conference on Dependable Systems and Networks
- 2002
- 163
- PDF
Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancy
- Mathematics
- 2000
- 62
Optimization of cyclic redundancy-check codes with 24 and 32 parity bits
- Mathematics, Computer Science
- IEEE Trans. Commun.
- 1993
- 119
Fast calculation of the number of minimum-weight words of CRC codes
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 2001
- 20
- Highly Influential
Analysis of the Train Communication Network Protocol Error Detection Capabilities
- Engineering
- 2001
- 17
- PDF
Mathematical packages: cyclic checksum,
- accessed September
- 2003
Radio broadcasting systems; DAta Radio Channel (DARC); System for wireless infotainment forwarding and teledistribution
- ETSI EN 300 751, V1.2.1, October
- 2002