n South African Computer Journal - The construction of codes for infinite sets : reviewed article
|Article Title||The construction of codes for infinite sets : reviewed article|
|© Publisher:||South African Computer Society (SAICSIT)|
|Journal||South African Computer Journal|
|Publication Date||Jun 2005|
|Pages||26 - 32|
|Keyword(s)||Golomb codes, Huffman codes, Information and Lossless compression|
Run-length encoding is used in applications that process digitised analogue data. Lossless image compression is an example. Golomb encoding is optimal for infinite geometric probability distributions. A wider class of codes is presented here, all of which are suitable for encoding the elements from an infinite set. It is shown that each code can be described by a polynomial k(L), which determines the number of codewords of lengthL. An even wider class of codes is also considered in which the number of codewords grows geometrically with their length. Criteria are given for excluding such codes from further consideration.
Article metrics loading...