32-bit cyclic redundancy codes for Internet applications
- 25 June 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 459-468
- https://doi.org/10.1109/dsn.2002.1028931
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Optimization of cyclic redundancy-check codes with 24 and 32 parity bitsIEEE Transactions on Communications, 1993
- On the Undetected Error Probability for Shortened Hamming CodesIEEE Transactions on Communications, 1985