Elias Gamma Coding

1. Write it in binary.
2. Subtract 1 from the number of bits written in step 1 and prepend that many zeros.

1. Separate the integer into the highest power of 2 it contains (2^N) and the remaining N binary digits of the integer.
2. Encode N in unary; that is, as N zeroes followed by a one.
3. Append the remaining N binary digits to this representation of N.

   1 1   2 010   3 011   4 00100   5 00101   6 00110   7 00111   8 0001000   9 0001001  10 0001010  11 0001011  12 0001100  13 0001101  14 0001110  15 0001111  16 000010000  17 000010001 

1. Read and count zeroes from the stream until you reach the first one. Call this count of zeroes N.
2. Considering the one that was reached to be the first digit of the integer, with a value of 2^N, read the remaining N digits of the integer.

<< Previous Word Browser Next >>
bauhin taylor's theorem united states atomic energy commission robert moon microsoft bob melinda gates hybrid transport moped scooter conveyor transport lipschitz continuity	moving sidewalk conveyor belt dark moon blimp american pie drawing board american pie (song) baen books cisco systems marco van basten trial of the twenty one	plantago tercet roadrunner graves basedow disease somerset rock around the clock duomo elias delta coding sidney altman hydrostatic equilibrium fleet air arm	church of satan map projection the flintstones bubblegum pop e.164 james gosling dave cutler side scan sonar underwater archaeology list of people on stamps meg ryan