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}
}
  • P. Koopman
  • Published 2002
  • Computer Science
  • Proceedings International Conference on Dependable Systems and Networks
  • 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
    • Justin Ray, P. Koopman
    • Computer Science
    • International Conference on Dependable Systems and Networks (DSN'06)
    • 2006
    • 44
    • PDF
    Cyclic redundancy code (CRC) polynomial selection for embedded networks
    • 335
    • PDF
    Configurable CRC Error Detection Model for Performance Analysis of Polynomial: Case Study for the 32-Bits Ethernet Protocol
    • 1
    • Highly Influenced
    Development of a reduction algorithm for CAN frame bits
    FPGA implementation of hamming code for increasing the frame rate of CAN communication
    • 3
    Error control with binary cyclic codes
    • PDF
    Coverage and the use of cyclic redundancy codes in ultra-dependable systems
    • 44
    • PDF
    Cooperative communication system with systematic Raptor codes
    • D. Wang, M. Soleymani
    • 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
    • 118
    On the Undetected Error Probability for Shortened Hamming Codes
    • 77
    Error control coding
    • 887
    • PDF
    When the CRC and TCP checksum disagree
    • 155
    • PDF
    Applied Coding and Information Theory for Engineers
    • 99
    S
    • 263,822
    • Highly Influential
    • PDF
    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