如何计算CRC中使用的XOR余数？

本文介绍了如何计算CRC中使用的XOR余数？的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！ 问题描述

我想记住如何计算循环冗余校验中XOR算法的余数，以验证网络消息的余数。

I'm trying to remember how the math is worked out to compute the remainder of an XOR algorithm in Cyclical Redundancy Checks to verify the remainder bits of a network message.

我不应该扔掉那本课本。

I shouldn't have tossed that text book.

这很容易用代码完成，但是如何手工完成呢？

This is easily done in code, but how is it worked out by hand?

我知道它看起来像是标准除法算法，但我不记得从那里可以得到余数。

I know it looks something like a standard division algorithm, but I can't remember where to go from there to get the remainder.

___________ 1010 | 101101000

注意：我用Google搜索过，但无法

Note: I did google it, but wasn't able to find a place where they mapped the steps in figuring the remainder.

推荐答案

用二进制11进行长除法。有一个例子在维基百科上。

It is long division by binary 11. There is an example on Wikipedia.