Elias delta coding explained

Elias δ code or Elias delta code is a universal code encoding the positive integers developed by Peter Elias.

Encoding

To code a number X ≥ 1:

1. Let N = ⌊log₂ X⌋; be the highest power of 2 in X, so 2^N ≤ X < 2^N+1.
2. Let L = ⌊log₂ N+1⌋ be the highest power of 2 in N+1, so 2^L ≤ N+1 < 2^L+1.
3. Write L zeros, followed by
4. the L+1-bit binary representation of N+1, followed by
5. all but the leading bit (i.e. the last N bits) of X.

An equivalent way to express the same process:

1. Separate X into the highest power of 2 it contains (2^N) and the remaining N binary digits.
2. Encode N+1 with Elias gamma coding.
3. Append the remaining N binary digits to this representation of N+1.

To represent a number

x , Elias delta (δ) uses \lfloor log _{2(x)} \rfloor + 2 \lfloor log _{2} (\lfloor log _{2(x)} \rfloor +1 ) \rfloor + 1 bits.This is useful for very large integers, where the overall encoded representation's bits end up being fewer [than what one might obtain using [[Elias gamma coding]]] due to the log _{2} (\lfloor log _{2(x)} \rfloor +1 ) portion of the previous expression.

The code begins, using

\gamma' instead of \gamma :

Number	N	N+1	δ encoding	Implied probability
1 = 2^0	0	1	1	1/2
2 = 2^1 + 0	1	2	0 1 0 ''0''	1/16
3 = 2^1 + 1	1	2	0 1 0 ''1''	1/16
4 = 2^2 + 0	2	3	0 1 1 ''00''	1/32
5 = 2^2 + 1	2	3	0 1 1 ''01''	1/32
6 = 2^2 + 2	2	3	0 1 1 ''10''	1/32
7 = 2^2 + 3	2	3	0 1 1 ''11''	1/32
8 = 2^3 + 0	3	4	00 1 00 ''000''	1/256
9 = 2^3 + 1	3	4	00 1 00 ''001''	1/256
10 = 2^3 + 2	3	4	00 1 00 ''010''	1/256
11 = 2^3 + 3	3	4	00 1 00 ''011''	1/256
12 = 2^3 + 4	3	4	00 1 00 ''100''	1/256
13 = 2^3 + 5	3	4	00 1 00 ''101''	1/256
14 = 2^3 + 6	3	4	00 1 00 ''110''	1/256
15 = 2^3 + 7	3	4	00 1 00 ''111''	1/256
16 = 2^4 + 0	4	5	00 1 01 ''0000''	1/512
17 = 2^4 + 1	4	5		1/512

To decode an Elias delta-coded integer:

1. Read and count zeros from the stream until you reach the first one. Call this count of zeros L.
2. Considering the one that was reached to be the first digit of an integer, with a value of 2^L, read the remaining L digits of the integer. Call this integer N+1, and subtract one to get N.
3. Put a one in the first place of our final output, representing the value 2^N.
4. Read and append the following N digits.

Example: 001010011 1. 2 leading zeros in 001 2. read 2 more bits i.e. 00101 3. decode N+1 = 00101 = 5 4. get N = 5 − 1 = 4 remaining bits for the complete code i.e. '0011' 5. encoded number = 2⁴ + 3 = 19

This code can be generalized to zero or negative integers in the same ways described in Elias gamma coding.

Example code

Encoding

void eliasDeltaEncode(char* source, char* dest)

Decoding

void eliasDeltaDecode(char* source, char* dest)

Generalizations

Elias delta coding does not code zero or negative integers.One way to code all non negative integers is to add 1 before coding and then subtract 1 after decoding.One way to code all integers is to set up a bijection, mapping integers all integers (0, 1, −1, 2, −2, 3, −3, ...) to strictly positive integers (1, 2, 3, 4, 5, 6, 7, ...) before coding.This bijection can be performed using the "ZigZag" encoding from Protocol Buffers (not to be confused with Zigzag code, nor the JPEG Zig-zag entropy coding).

See also

• Elias gamma (γ) coding
• Elias omega (ω) coding
• Golomb-Rice code

Further reading

• https://link.springer.com/article/10.1007/BF03037427 --> URR: Universal representation of real numbers . Hozumi . Hamada . New Generation Computing . 0288-3635 . June 1983 . 1 . 2 . 205–209 . 10.1007/BF03037427 . 12806462 . 2018-07-09. (NB. The Elias δ code coincides with Hamada's URR representation.)