Talk:Exponential-Golomb coding: Difference between revisions

Revision as of 13:06, 2 January 2015

Latest revision as of 15:23, 1 February 2024

(3 intermediate revisions by 3 users not shown)

Line 1:

{{WikiProject Computer sciencebanner shell|needs-infobox=y}}

{{WikiProject Computer science}}

}}

== 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. <small><span class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Bumblebritches57|Bumblebritches57]] ([[User talk:Bumblebritches57|talk]] • [[Special:Contributions/Bumblebritches57|contribs]]) 17:21, 26 May 2016 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->