This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
February 1961
·
1,205 Reads
·
567 Citations
Proceedings of the IRE
Cyclic codes are defined and described from a new viewpoint involving polynomials. The basic properties of Hamming and Fire codes are derived. The potentialities of these codes for error detection and the equipment required for implementing error detection systems using cyclic codes are described in detail.
... Just as with parity calculation, we have several available algorithms to calculate checksum. Fletcher [13], Adler [14] and CRC [15] are some of the arithmetic and polynomial algorithms. Fletcher's arithmetic checksum has been demonstrated to provide similar reliability to more complex CRC while being much faster due to its simple and computationally efficient algorithm. ...
February 1961
Proceedings of the IRE
