Timeline for Calculating the Min Entropy of a string of bits
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 27, 2016 at 13:17 | vote | accept | guy | ||
| Oct 26, 2016 at 12:26 | answer | added | tylo | timeline score: 0 | |
| Oct 25, 2016 at 20:29 | comment | added | SEJPM | The math sounds about right to me. | |
| Oct 25, 2016 at 18:23 | comment | added | guy | Yes exactly! Let me know if I should rephrase it again. I understand it is strange. (Hence my confusion) | |
| Oct 25, 2016 at 18:20 | comment | added | CodesInChaos | I still don't get your second point. You mean that 8 of the 16 possible values are chosen with probability 1/8 and the other 8 possible values are never chosen? | |
| Oct 25, 2016 at 18:17 | comment | added | guy | You're right, let me rephrase it. | |
| Oct 25, 2016 at 18:15 | history | edited | guy | CC BY-SA 3.0 |
added 3 characters in body
|
| Oct 25, 2016 at 18:15 | comment | added | CodesInChaos | Your second sentence makes no sense. There are 16 possible combinations, they can't all have the probability 1/8, since that's 200%. Also that'd be uniform "perfectly random". | |
| Oct 25, 2016 at 17:58 | history | asked | guy | CC BY-SA 3.0 |