THE GOLOMB CODE-Students Report- Group B

Golomb coding
Golomb coding is a lossless data compression
method
Using a family of data compression codes
invented by
Solomon W. Golomb in the 1960s. Alphabets
following
a geometric distribution will have a Golomb
code as an
Optimal prefix code, making Golomb coding
highly suitable for situations in which the
occurrence of small values
In the input stream is significantly more likely
than large
Values.
The Golomb code is described in a succinct
paper [28] by Solomon Golomb, which begins
“Secret Agent 00111 is back at the Casino
again, playing a game of chance,
While the fate of mankind hangs in the
balance.” Agent 00111 requires a code to
represent runs of success in a roulette
game, and Golomb provides it! The Golomb
code is actually a family of codes
parameterized by an integer m > 0. In the
Golomb code with parameter m, we
represent an integer n > 0 using two
numbers q and r, where
And
r = n-qm
X is the integer part of x. In other words, q is
the quotient and r is the remainder when n is
divided by m.
The quotient q can take on values 0 1 2 and is
represented by the unary code of q. The
remainder r can take on the values 0 1 2 m-1
If m is a power of two, we use the log2 m-bit
binary