Timeline for Conceptual problem : numberof symbols for nonuniform distribution using entropy : how to determine block size?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 25, 2017 at 6:04 | comment | added | Cherny | It depends on your application, in communications the block size depends on needed delay, complexity of decoder, and needed error rate. So you should specify your aim. Sorry I'm answering with such delay, I'm on vacation | |
| Feb 23, 2017 at 17:29 | comment | added | SKM | The entropy of $N$ random symbols corresponding to a block of $N$ iid outputs from a discrete memeoryless source is $H(X^N) = NH(X)$ This is my main question. Should there be any condition or criteria for selecting the block length, $N$? Could you please clarify these? Thanks for your time and effort. | |
| Feb 23, 2017 at 17:21 | comment | added | SKM | Thank you for your reply. But still many things are unclear. (A) which plot -- Fig(a) or Fig(b) is the correct plot to see if entropy does not change at a particular block value. (B) Wanted to confirm the formula of block entropy as: $$H_l = -\frac{1}{l}\sum_{w \in \lbrace a_1,a_2,...,a_m\rbrace^l} p_w \log_2 p_w $$ and in my implementation if I am using the correct formula to plot the proper graph. (3) Based on your calculation, does this mean that I can use any number of blocks? | |
| Feb 23, 2017 at 12:32 | history | answered | Cherny | CC BY-SA 3.0 |