The simplest coding methods are those that ignore or make only minimal use of the supplied probabilities. In doing so, their compression effectiveness may be relatively poor, but the simple and regular codewords that they assign can usually be encoded and decoded extremely quickly. Moreover, some compression applications are such that the source probabilities p i have a distribution to which the regular nature of these non-parameterized codes is well suited.
KeywordsBinary Code Binary Search Code Algorithm Unary Code Binary Component
Unable to display preview. Download preview PDF.