n South African Computer Journal - The construction of codes for infinite sets : reviewed article




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 , which determines the number of codewords of length 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...

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error