Talk:Exponential-Golomb coding
Add topicLatest comment: 10 years ago by Bumblebritches57 in topic Simplify
 | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
Simplify
[edit]I'm a beginner to this, but this is a bit confusing "Count the bits written, subtract one, and write that number of starting zero bits preceding the previous bit string."
It looks to me like you're counting the number of digits from the highest set bit, to bit 0, so in the case of the number 7 which in binary is: 0111, the Ex-Golomb code would be 000100, because the number of leading digits is the actual length of the code, so 3, and the 1 marks the position in which those ones start?
I'm just really confused, because like always, wikipedia assumes people have a degree in math. — Preceding unsigned comment added by Bumblebritches57 (talk • contribs) 17:21, 26 May 2016 (UTC)