• DOI:10.1109/DSN.2002.1028931
Corpus ID: 14775606

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

View on IEEE

ece.cmu.edu

Save to Library

Create Alert

Cite

Launch Research Feed