Theoremcore
Shannon source coding theorem
Also called noiseless coding theorem.
No lossless code has average length below H, and codes within one bit of H exist, so H is the limit.
No lossless code has average length below H, and codes within one bit of H exist, so H is the limit.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 53WS0H Edit this page History Report an error