Timeline for Analyzer for compression algorithms (or tools)
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 31, 2016 at 23:54 | comment | added | JS1 |
@MatteoDelSeppia Since \$\log a^b = (\log a) * b\$, @MartinR's formula is correct and faster than using pow().
|
|
| Aug 31, 2016 at 17:20 | comment | added | user116360 | Thanks for all, really. The shannon function is right, i'm just using a logarithm property. The original is H(x) = sum(Pi*log2(Pi) where P is the frequency of a symbol and i is an index from 0 and 256. | |
| Aug 31, 2016 at 15:48 | history | edited | Martin R | CC BY-SA 3.0 |
deleted 58 characters in body
|
| Aug 31, 2016 at 15:37 | history | edited | Martin R | CC BY-SA 3.0 |
added 98 characters in body
|
| Aug 31, 2016 at 15:28 | history | answered | Martin R | CC BY-SA 3.0 |