Exponential-Golomb coding: Difference between revisions

Revision as of 23:14, 26 September 2006

Revision as of 23:26, 26 September 2006

Line 1:

An '''Exponential-Golomb code''' (or just '''Exp-Golomb code''') isof aorder family<math>k</math> ofis a [[Universal code (data compression)|universal codescode]], parameterized by [[whole number]] <math>k</math>. To codeencode a nonnegative integer in exp-Golomb codean order-<math>k</math> exp-Golomb code, one can use the following method:

# Write all but the last <math>k</math> bits plus 1 in binary.

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