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 entropy
Search options not deleted
user 105750
2
votes
1
answer
272
views
When Huffman coding is inefficient?
I know that for a general prefix code we have the following inequality:
$$ H(X) \le R \le H(X) + 1 $$
$R$ being the rate (average codeword length) and $H$ is the entropy. … Based on this relation, how can we conclude that Huffman coding is very inefficient if entropy of the source is much smaller than 1 bit/symbol? …
- 171
1
vote
1
answer
420
views
How to calculate conditional entropy
I'm new to information theory and I am struggling to understand this problem. Let $p(x,y)$ given by:
How can we calculate $H(X|Y)$? I know $H(X|Y)=H(X|Y=0)+H(X|Y=1)$ but then I don't know how to go …
- 171