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
    340 Citations

    Figures, Tables, and Topics from this paper

    CRC Codes for Error Control 1
    • PDF
    New Heuristic Model for Optimal CRC Polynomial
    • 3
    • Highly Influenced
    • PDF
    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
    Coverage and the use of cyclic redundancy codes in ultra-dependable systems
    • 44
    • PDF
    Joint optimum message length and generator polynomial selection in cyclic redundancy check (CRC) coding
    • 4
    A sieving method for the optimization of embedded CRC codes
    • 1
    Generalized parallel CRC computation on FPGA
    • 8
    Analysis of Combinations of CRC in Industrial Communication
    • 6
    1 Investigating CRC Polynomials that Correct Burst Errors
    • PDF

    References

    SHOWING 1-10 OF 28 REFERENCES
    32-bit cyclic redundancy codes for Internet applications
    • P. Koopman
    • Computer Science
    • Proceedings International Conference on Dependable Systems and Networks
    • 2002
    • 163
    • PDF
    On the cyclic redundancy-check codes with 8-bit redundancy
    • 31
    Optimization of cyclic redundancy-check codes with 24 and 32 parity bits
    • 119
    Fast calculation of the number of minimum-weight words of CRC codes
    • P. Kazakov
    • Mathematics, Computer Science
    • IEEE Trans. Inf. Theory
    • 2001
    • 20
    • Highly Influential
    Error Control Coding
    • 1,386
    • 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