Timeline for Efficient computation of $x^n \bmod g(x)$ in $\mathbb{F}_2[x]$
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 9 at 21:23 | review | Close votes | |||
| Sep 16 at 3:08 | |||||
| Sep 9 at 21:07 | comment | added | Max Alekseyev | This is question more suitable for cs.stackexchange.com | |
| S Sep 9 at 14:09 | history | suggested | CommunityBot | CC BY-SA 4.0 |
better MathJax usage
|
| Sep 9 at 14:08 | review | Suggested edits | |||
| S Sep 9 at 14:09 | |||||
| Sep 9 at 7:32 | comment | added | Peter Taylor | Your current method is the standard one. Typically in CRC32 applications $g$ will be chosen such that the period of $x$ is $2^{32}-1$. | |
| Sep 8 at 22:01 | comment | added | Achim Krause | You can factor $g$ and use the Chinese remainder theorem to split $\mathbb{F}_2[x]/g(x)$ into factors. For example if $g$ is separable, it will split as product of finite fields $\mathbb{F}_q$. In each of those $x^n$ will be $q-1$-periodic. | |
| S Sep 8 at 21:39 | review | First questions | |||
| Sep 8 at 23:20 | |||||
| S Sep 8 at 21:39 | history | asked | Kamila Szewczyk | CC BY-SA 4.0 |