[aklug] Re: [OT] Re: random bits vs random Hex

From: Christopher Howard <christopher.howard@frigidcode.com>
Date: Tue May 28 2013 - 23:02:22 AKDT

On 05/28/2013 10:25 PM, bryanm@acsalaska.net wrote:
> On Tue, May 28, 2013 9:29 pm, Christopher Howard wrote:
>
> That brings up an interesting point (which was not part of the original
> post). What if you change to a base that doesn't match so well? For
> example, take a random string of bits, group them into triplets, and
> convert each one to a decimal digit.
>
> 001 011 000 110 111 010 010 101
> ..1 ..3 ..0 ..6 ..7 ..2 ..2 ..5
>
> If the original string of bits is random, each new bit is equally likely
> to take either of the possible states {0,1}. When converted to decimal,
> though, each new digit is equally likely to be one of 0 through 7, but
> it will never be 8 or 9. Whether that is useful information, of course,
> depends on the application.
>

Again, the number of /allowed states/ has not changed.

In one case, number of states are 2^(3n). In other case, 8^n. And, of
course:

 2^(3n) = (2^3)^n = 8^n

Unless I'm remembering my exponent math incorrectly, which has happened
before. :|

-- 
frigidcode.com

---------
To unsubscribe, send email to <aklug-request@aklug.org>
with 'unsubscribe' in the message body.

Received on Tue May 28 23:02:49 2013

This archive was generated by hypermail 2.1.8 : Tue May 28 2013 - 23:02:49 AKDT