Fast CRCs (Extended Version)

Details Fast CRCs (Extended Version) Fast CRCs (Extended Version)

2010-09-29

arxiv.org/abs/1009.5949v1

G.D. Nguyen, "Fast CRCs," IEEE Transactions on Computers, vol. 58, no. 10, pp. 1321-1331, Oct. 2009

Computer Science

Information Theory

64 pages, 43 figures, an extended version of a published journal paper

Scientific paper

CRCs have desirable properties for effective error detection. But their software implementation, which relies on many steps of the polynomial division, is typically slower than other codes such as weaker checksums. A relevant question is whether there are some particular CRCs that have fast implementation. In this paper, we introduce such fast CRCs as well as an effective technique to implement them. For these fast CRCs, even without using table lookup, it is possible either to eliminate or to greatly reduce many steps of the polynomial division during their computation.

Affiliated with

Also associated with

No associations

Rating

Fast CRCs (Extended Version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast CRCs (Extended Version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast CRCs (Extended Version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524552