Exponential-Golomb coding: Difference between revisions

Revision as of 09:02, 15 July 2010

Revision as of 21:45, 8 October 2010

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 [[wholenonnegative numberinteger]] ''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.

# Count the bits written, subtract one, and write that number of starting zero bits preceding the previous bit string.