Exponential-Golomb coding: Difference between revisions

Revision as of 07:07, 11 September 2009

Revision as of 04:17, 17 December 2009

Line 1:

{{Unreferenced|date=December 2009}}

An '''exponential-Golomb code''' (or just '''Exp-Golomb code''') of order ''k'' is a type of [[Universal code (data compression)|universal code]], parameterized by a [[whole number]] ''k''. To encode a nonnegative integer in an order-''k'' exp-Golomb code, one can use the following method:

# Take the number in binary except for the last ''k'' digits and add 1 to it (arithmetically). Write this down.

Line 24 ⟶ 25:

Despite the similar name, exp-Golomb is only somewhat similar to [[Golomb coding]], which is a type of entropy coding but not a universal code.

==See also==

*[[Elias gamma coding]]

*[[Elias delta coding]]

Line 32 ⟶ 33:

{{Compression Methods}}

{{DEFAULTSORT:Exponential-Golomb Coding}}

[[Category:Numeration]]

[[Category:Lossless compression algorithms]]

[[Category:Articles lacking sources (Erik9bot)]]

[[ru:Экспоненциальный код Голомба]]