View Single Post
Posts: 15 | Thanked: 6 times | Joined on Jun 2010
#10
Originally Posted by lma View Post
A quick test with ent on a 1MiB sample suggests it is:
Code:
$ ent hwrngdump
Entropy = 7.999823 bits per byte.

Optimum compression would reduce the size
of this 1048576 byte file by 0 percent.
I take that to indicate the compression algorithm in ent is not taking advantage of all forms of repetition. Having a disproportionately high number of very short patterns (of 06 and 16), for example, isn't necessarily enough to get significant compression.
Originally Posted by lma View Post
Well, as its name suggests, od outputs octal values by default so that's to be expected ;-)
Good point! But what about the disproportionate number of 0's and 1's, while 2-7 was evenly distributed?

Last edited by samualwalters; 2010-07-10 at 08:12.