Talk:Arithmetic coding/As a generalized change of radix: Difference between revisions
Talk:Arithmetic coding/As a generalized change of radix (view source)
Revision as of 19:36, 28 January 2016
, 8 years agono edit summary
mNo edit summary |
No edit summary |
||
Line 20:
:::::<math> \mathrm{U} = \mathrm{L} + \prod_{k=1}^{n} f_k </math>
:::: After this point, it doesn't matter which number <math>N</math> we return, as long as <math>L <= N < U</math>. --[[User:Trizen|Trizen]] ([[User talk:Trizen|talk]]) 17:28, 28 January 2016 (UTC)
::::: For some reason, math markup isn't working right now, so that's a bit hard to read. But basically you seem to be restating the fact that you are using cumulative frequencies? But my question is why are you using cumulative frequencies? -- the use of cumulative frequencies conflicts with the example and text at [[wp:Arithmetic_coding#Arithmetic_coding_as_a_generalized_change_of_radix|wikipedia]]. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 19:35, 28 January 2016 (UTC)
| |||