Iterated Log Coding
adamscherlis.github.io
Iterated Log Coding
1–10 of 40 posts
Re: Iterated Log Coding
#2Feels a bit like binary encoding with + and - instead of 0 and 1
Re: Iterated Log Coding
#3Cute! I wonder if it would be amenable for use as a variable-width encoding for, say, DCT coefficients in a JPEG-like codec..?
Re: Iterated Log Coding
#4Given an integer n, what is the number of bits required to represent every integer in the range -n..n ?
Re: Iterated Log Coding
#5It reminds me of schemes like https://en.wikipedia.org/wiki/Elias_delta_coding , https://en.wikipedia.org/wiki/Elias_omega_coding
Re: Iterated Log Coding
#6How feasible is it to do arithmetic directly in this representation?
Re: Iterated Log Coding
#7Nice and elegant! Surprising it was not discovered earlier (unless it was and we're unaware of it).
Re: Iterated Log Coding
#8Given an integer n, what is the number of bits required to represent every integer in the range -n..n ?
> Given an integer n, what is the number of bits required to represent every integer in the range -n..n ?
(log n) + 1
Re: Iterated Log Coding
#9Given an integer n, what is the number of bits required to represent every integer in the range -n..n ?
> Given an integer n, what is the number of bits required to represent every integer in the range -n..n ? (log n) + 1
That's true for normal binary encoding of integers, but I think we should understand the question in context of the post: What's the number of bits required in iterated log coding?
Re: Iterated Log Coding
#10[deleted]