32-bit cyclic redundancy codes for Internet applications
@article{Koopman200232bitCR, title={32-bit cyclic redundancy codes for Internet applications}, author={P. Koopman}, journal={Proceedings International Conference on Dependable Systems and Networks}, year={2002}, pages={459-468} }
Standardized 32-bit cyclic redundancy codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethernet messages, whereas HD=6 is possible. Although research has revealed improved codes, exploring the entire design space has previously been computationally intractable, even for special-purpose hardware. Moreover, no CRC polynomial has yet been found that satisfies an emerging need to attain both HD=6 for 12K bit… CONTINUE READING
162 Citations
Efficient High Hamming Distance CRCs for Embedded Networks
- Computer Science
- International Conference on Dependable Systems and Networks (DSN'06)
- 2006
- 44
- PDF
Cyclic redundancy code (CRC) polynomial selection for embedded networks
- Computer Science
- International Conference on Dependable Systems and Networks, 2004
- 2004
- 335
- PDF
Configurable CRC Error Detection Model for Performance Analysis of Polynomial: Case Study for the 32-Bits Ethernet Protocol
- Computer Science
- NEW2AN
- 2015
- 1
- Highly Influenced
Development of a reduction algorithm for CAN frame bits
- Computer Science
- 2017 International SoC Design Conference (ISOCC)
- 2017
FPGA implementation of hamming code for increasing the frame rate of CAN communication
- Computer Science
- 2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)
- 2016
- 3
Implementation of an Enhanced-Hamming Code Method for CAN Communication to Reduce the Frame Bits
- Computer Science
- ICCIS '16
- 2016
Design of parallel fault-secure encoders for systematic cyclic block transmission codes
- Computer Science
- Microelectron. J.
- 2009
- 7
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
Cooperative communication system with systematic Raptor codes
- Computer Science
- 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)
- 2012
- 2
References
SHOWING 1-10 OF 18 REFERENCES
Optimization of cyclic redundancy-check codes with 24 and 32 parity bits
- Mathematics, Computer Science
- IEEE Trans. Commun.
- 1993
- 118
On the Undetected Error Probability for Shortened Hamming Codes
- Computer Science
- IEEE Trans. Commun.
- 1985
- 77
iSCSI
- Internet-Draft work in progress, http://www.ietf.org/internet-drafts/draft-ietf-ips-iscsi -08.txt, Sept. 30 2001, accessed Nov. 10,
- 2001
IP Storage (ips) Charter
- IP Storage (ips) Charter
- 2001
Internet-Draft work in progress, http://www.ietf.org/internet-drafts/draft-ietf-ips-iscsi -08.txt
- Internet-Draft work in progress, http://www.ietf.org/internet-drafts/draft-ietf-ips-iscsi -08.txt
- 2001
iSCSI CRC/Checksum Considerations Internet-Draft work in progress, http://search. ietf.org/internet-drafts/draft-sheinwald-iscsi-crc-00.txt
- iSCSI CRC/Checksum Considerations Internet-Draft work in progress, http://search. ietf.org/internet-drafts/draft-sheinwald-iscsi-crc-00.txt
- 2001