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 2294
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".
4
votes
Large subgroups of the Hamming cube
You can get half of the elements small. Let $e_k$ be the element $(0,0,\ldots,0,1,0, \ldots 0)$ with a single $1$ in the $k$th position. Let $v$ be the element $(1,1,1,1,1,\ldots,1)$. Now, consider th …
- 6,342
4
votes
How to find the $\pm 1$ vector that is closest to a given vector $(r_1, \dots, r_l)$? Is it ...
Let the $R_i$ be $\pm 1$ vectors and the $V_i$ be a linear space over GF(2). This then becomes the problem of maximum likelihood decoding of binary linear codes, which is known to be an NP-hard proble …
- 6,342