We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0d13876 commit 647fa43Copy full SHA for 647fa43
README.md
@@ -134,9 +134,9 @@ You can describe this mathematically in [GF(2)][gf2] (the extra
134
$x^{\left|P(x)\right|}$ represents shifting the message to make space for
135
the CRC), but the above example is probably easier to understand:
136
137
-$$
+``` math
138
C(x) = M(x) x^{\left|P(x)\right|} - (M(x) x^{\left|P(x)\right|} \bmod P(x))
139
+```
140
141
The neat thing is that this remainder operation does a real good job of
142
mixing up all the bits. So if you choose a good CRC polynomial, it's very
0 commit comments