Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with coding-theory
Search options not deleted
user 537654
The theory of error-correcting codes stems from Shannon's 1948 _A mathematical theory of communication_, and from Hamming's 1950 "Error detecting and error correcting codes".
3
votes
0
answers
155
views
Efficient computation of $x^n \bmod g(x)$ in $\mathbb{F}_2[x]$
Related to this question. I wish to compute $x^n \bmod g(x)$ in $\mathbb{F}_2[x]$ for some fixed and known upfront $g$. This problem pops up in computing the 'pure' CRC function of a bit sequence of a …
- 139