Jump to content

Talk:Exponential-Golomb coding

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Bumblebritches57 (talk | contribs) at 17:21, 26 May 2016 (Simplify: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputer science Unassessed
WikiProject iconThis article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
???This article has not yet received a rating on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.
Note icon
This article has been marked as needing an infobox.
Things you can help WikiProject Computer science with:

Simplify

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.