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 it.information-theory
Search options not deleted
user 76368
Theoretical and experimental aspects of information theory and coding theory. This tag covers but is not limited to following branches: information theory, information geometry, optimal transportation theory, coding theory.
2
votes
Accepted
Minimize average bitwise entropy with given pairwise hamming distance
First decompose the total distance $D$ by component: $$D = \sum_{i,j\in [n]} d(a_i,a_j) = \sum_{l \in [m]} \sum_{i,j\in [n]} \mathbf{1}\{a_{il} \neq a_{jl}\}.$$ Let $\delta_l = \frac{1}{n^2} \sum_{i,j …
- 116