| Unary Coding |
Article Index for Unary |
Shopping Coding |
Website Links For Coding |
Information AboutUnary Coding |
| CATEGORIES ABOUT UNARY CODING | |
| coding theory | |
| data compression | |
| lossless compression algorithms | |
Unary coding is an optimally efficient encoding for the following discrete Probability Distribution : for . In symbol-by-symbol coding, it is optimal for any Geometric Distribution : for which ''k'' ≥ φ = 1.61803398879…, the Golden Ratio , or, more generally, for any discrete distribution for which : for . Although it is the optimal symbol-by-symbol coding for such probability distributions, its optimality can, like that of Huffman Coding , be over-stated. Arithmetic Coding has better compression capability for the last two distributions mentioned above because it does not consider input symbols independently, but rather implicitly groups the inputs. A modified unary encoding is used in UTF-8 . Unary codes are also used in split-index schemes like the Golomb Rice Code . Unary coding is Prefix-free , and can be uniquely decoded. REFERENCES
|
|
|