Golomb coding: Difference between revisions

Revision as of 05:48, 7 November 2022

Revision as of 22:39, 7 November 2022

Line 47:

== Simple algorithm ==

Note below that thisBelow is the Rice–Golomb encoding, where the remainder code uses simple truncated binary encoding, also named "Rice coding" (other varying-length binary encodings, like arithmetic or Huffman encodings, are possible for the remainder codes, if the statistic distribution of remainder codes is not flat, and notably when not all possible remainders after the division are used). In this algorithm, if the ''M'' parameter is a power of 2, it becomes equivalent to the simpler Rice encoding:

# Fix the parameter ''M'' to an integer value.