Re: How big could a bar code be if a bar code be big?

From: David Mertz <voting-project_at_gnosis_dot_cx>
Date: Sat May 01 2004 - 21:20:55 CDT

On May 1, 2004, at 4:01 PM, Alan Dechert wrote:
>> Well, the ranked preference will require a little thought, but the
>> others are almost self-evident.
> I don't see any special issue with rank preference. It's just a
> sequence of
> bits....able to map worse case 4 bits to these nine patterns

You've just used 32 bits to describe data with 17 bits of entropy.
That's not a crime, nor particularly bad as an encoding.

But what I meant would take a little thought would be designing a
generic encoding (for all N and M) that encoded using no more bits than
the inherent entropy of a ranked preference contest. Of course, I'll
round up to the nearest bit rather than use fractional bits. It won't
take any act of genius to accomplish this, just, well, a little
thought.
==================================================================
= The content of this message, with the exception of any external
= quotations under fair use, are released to the Public Domain
==================================================================
Received on Mon May 31 23:17:02 2004

This archive was generated by hypermail 2.1.8 : Mon May 31 2004 - 23:18:15 CDT