Algorithmintro
Shannon-Fano coding
Also called Shannon-Fano.
Top-down split of sorted symbols into two near-equal-probability halves; near-optimal but not always optimal.
Top-down split of sorted symbols into two near-equal-probability halves; near-optimal but not always optimal.
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 M37AW1 Edit this page History Report an error