Jump to content

User:C-processor/Polar Tree

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by C-processor (talk | contribs) at 03:52, 21 August 2010. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.