unary coding

In discrete mathematics and computer science, Unary coding.

Unary coding is prefix-free, and can be uniquely decoded.

Golomb coding, which has Rice coding and unary coding as special cases.

These static codes include universal codes (such as Elias gamma coding or Fibonacci coding) and Golomb codes (such as unary coding or Rice coding).

If we compute the gaps between adjacent values in a list of strictly increasing integers and encode them using unary coding, the result is a bit array with a 1 bit in the nth position if and only if n is in the list.