Talk:Rice coding: Difference between revisions
Content added Content deleted
(Wat?) |
mNo edit summary |
||
| Line 2: | Line 2: | ||
It's difficult to tell whether the current implementation here is correct. |
It's difficult to tell whether the current implementation here is correct. |
||
Ricde coding is apparently a compression technique, but inspecting the <code>encode</code> implementation, I see <code>($n mod $d).polymod(2 xx $k - 1).reverse<code> which probably means that the encoded number would have at least as many bits as the value of the number being encoded. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 12:03, 21 September 2023 (UTC) |
Ricde coding is apparently a compression technique, but inspecting the <code>encode</code> implementation, I see <code>($n mod $d).polymod(2 xx $k - 1).reverse</code> which probably means that the encoded number would have at least as many bits as the value of the number being encoded. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 12:03, 21 September 2023 (UTC) |
||
Revision as of 12:03, 21 September 2023
No examples?
It's difficult to tell whether the current implementation here is correct.
Ricde coding is apparently a compression technique, but inspecting the encode implementation, I see ($n mod $d).polymod(2 xx $k - 1).reverse which probably means that the encoded number would have at least as many bits as the value of the number being encoded. --Rdm (talk) 12:03, 21 September 2023 (UTC)