论文信息 - Computation of cyclic redundancy checks via table look-up

Computation of cyclic redundancy checks via table look-up

Cyclic Redundancy Check (CRC) codes provide a simple yet powerful method of error detection during digital data transmission. Use of a table look-up in computing the CRC bits will efficiently implement these codes in software.

Dilip V. Sarwate

[1] Georgia Griffiths,et al. The tea-leaf reader algorithm: an efficient implementation of CRC-16 and CRC-32 , 1987, CACM.

[2] Benjamin Arazi,et al. A commonsense approach to the theory of error correcting codes , 1988, MIT Press Series in Computer Systems.

[3] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[4] Dimitri P. Bertsekas,et al. Data Networks , 1986 .

[5] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[6] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .