4 ms·
It only takes 226 bits of entropy if all shuffles should be equally likely. If one shuffle has probability sufficiently close to 1, and the rest are equally lik
by im2w1l 11y ago
It only takes 226 bits of entropy if all shuffles should be equally likely. If one shuffle has probability sufficiently close to 1, and the rest are equally likely, you could make do with less than a bit of entropy.
- dietrichepp 11y agoRight, that's what "uniformly" means. Discrete uniform distribution = all shuffles are equally likely.