User:C-processor/Polar Tree
 |
| An editor has performed a search and found that sufficient sources exist to establish the subject's notability. |
Polar Tree is set of binary codes assigned to a symbol set in the process known in information theory as entropy encoding. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are Shannon-Fano coding and Huffman coding.
| Symbol | Frequency | Huffman codes | Shannon-Fano codes | Polar codes |
|---|---|---|---|---|
| A | B | C | D | E |
| 15 | 7 | 6 | 6 | 5 |
| 0 | 100 | 101 | 110 | 111 |
| 0 | 100 | 101 | 110 | 111 |
| 0 | 100 | 101 | 110 | 111 |