摘要: Standardized 32-bit cyclic redundancy codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) only 4 for maximum-length Ethernet messages, whereas HD=6 is possible. Although research has revealed improved codes, exploring the entire design space previously been computationally intractable, even special-purpose hardware. Moreover, no CRC polynomial yet found that satisfies an emerging need to attain both 12K bit messages and HD=4 message lengths beyond 64 Kbits. This paper presents results from first exhaustive search space. Results previous are validated extended include identifying all polynomials better HD IEEE 802.3 CRC-32 polynomial. A new class identified provides up nearly 16K 114K lengths, providing best achievable point maximizes legacy applications, including potentially iSCSI application-implemented checks.
acm.org 
sci-hub.se 参考文章(4)
Richard B. Wells, Applied Coding and Information Theory for Engineers ,(1998)
Jonathan Stone, Craig Partridge, When the CRC and TCP checksum disagree acm special interest group on data communication. ,vol. 30, pp. 309- 319 ,(2000) , 10.1145/347057.347561
T. Fujiwara, T. Kasami, A. Kitai, Shu Lin, On the Undetected Error Probability for Shortened Hamming Codes IEEE Transactions on Communications. ,vol. 33, pp. 570- 574 ,(1985) , 10.1109/TCOM.1985.1096340
G. Castagnoli, S. Brauer, M. Herrmann, Optimization of cyclic redundancy-check codes with 24 and 32 parity bits IEEE Transactions on Communications. ,vol. 41, pp. 883- 892 ,(1993) , 10.1109/26.231911