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 |
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
Error bounds for truncating a probability distribution based on the entropy?
I was able to answer my own question with a little help from my fellow physicists :)
Similar result for Renyi entropy
I stumbled upon a weaker version of this result before finding Lemma 2 of http …
2
votes
1
answer
308
views
Error bounds for truncating a probability distribution based on the entropy?
Heuristic Background
Consider a set of states labeled $n=1,2,...$ in order of non-increasing probability $p(n)$.
The standard Shannon argument gives meaning to the entropy $S$ of $p$ in terms of the …