Exponential-Golomb coding: Difference between revisions

Revision as of 23:04, 8 September 2016

Revision as of 11:45, 17 October 2016

Line 15:

...<ref name="richardson"/>

This is identical to the [[Elias gamma code]] of ''x''+1, allowing it to encode 0.<ref>{{cite book |last = Rupp |first = Markus |title = Video and Multimedia Transmissions over Cellular Networks: Analysis, Modelling and Optimization in Live 3G Mobile Networks |year = 2009 |publisher = Wiley |pages = 149 |url = httphttps://books.google.com/books?id=H9hUBT-JvUoC&lpg=PA149&dq=Exponential-Golomb%20coding&pg=PA149#v=onepage&q=Exponential-Golomb%20coding&f=false }}</ref>

==Extension to negative numbers==

Line 28:

4 ⇒ 7 ⇒ 1000 ⇒ 0001000

−4 ⇒ 8 ⇒ 1001 ⇒ 0001001

...<ref name="richardson">{{cite book |last = Richardson |first = Iain |title = The H.264 Advanced Video Compression Standard |year = 2010 |publisher = Wiley |isbn = 978-0-470-51692-8 |pages = 208,221 |url = httphttps://books.google.com/books?id=LJoDiPnBzQ8C&lpg=PA208&dq=Exponential-Golomb%20coding&pg=PA221#v=onepage&q=Exponential-Golomb%20coding&f=false }}</ref>

In other words, a non-positive integer ''x''≤0 is mapped to an even integer −2''x'', while a positive integer ''x''&gt;0 is mapped to an odd integer 2''x''−1.