Timeline for Shannon problem
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 29, 2018 at 7:15 | vote | accept | lulu2612 | ||
| Nov 28, 2018 at 20:08 | answer | added | kodlu | timeline score: 1 | |
| Nov 28, 2018 at 16:52 | comment | added | lulu2612 | Yes, Ai has probability pi, and you write well about the n symbols and about the sequence Xk. But the source is variable. That means that it transmits (A1, A2, A3, A4, A5, ... Aj) with j≤n. And when its entropy H(X)>C, it doesn't transfer as much information as it needs to reduce its entropy. That is to mean, it self-manages entropy to maintain H(X)<C. For this, each Ai is assigned a "coefficient of importance" λi. And the source no longer transfers information Ai that has a small λi. If you can help me to describe this source with the standard terminology thank you very much | |
| Nov 28, 2018 at 11:02 | comment | added | kodlu | As for the less important, more important part, and leaving symbols out, it is really difficult to understand what you mean. Please look at the information theory course page at web.stanford.edu/class/ee376a/reading.html and rewrite what you want in the standard terminology used in this course. | |
| Nov 28, 2018 at 11:00 | comment | added | kodlu | This is quite incomprehensible, it's not an English problem per se. Do you mean $A_i$ has probability $p_i$? so you have an $n$ symbol alphabet $\{A_1,\ldots,A_n\}$? (you should use Latex for equations). What is the source transmitting? A sequence $X_k,$ for $k\geq 1,$ so that $P[X_k=A_i]=p_i$? | |
| Nov 28, 2018 at 10:45 | review | First posts | |||
| Nov 28, 2018 at 11:43 | |||||
| Nov 28, 2018 at 10:41 | history | asked | lulu2612 | CC BY-SA 4.0 |