Exponential-Golomb coding: Difference between revisions

Revision as of 00:22, 12 January 2007

Revision as of 03:42, 12 January 2007

Line 1:

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

# WriteTake allthe butnumber in binary except for the last <math>k</math> bitsdigits plusand add 1 into binaryit (arithmetically). Write this down.

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

# Write the last <math>k</math> bits in binary.