Golomb coding is a form of entropy encoding used in data compression, particularly suitable for representing non-negative integers with a geometric probability distribution. It was introduced by Solomon W. Golomb. The primary idea behind Golomb coding is to efficiently encode integers that commonly occur in certain applications, such as run-length encoding or certain types of image compression.
Articles by others on the same topic
There are currently no matching articles.