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

From: Alan Dechert <alan_at_openvotingconsortium_dot_org>
Date: Sat May 01 2004 - 15:01:59 CDT

> 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.

For each candidate you have bits for each possible ranking (and no rank).

For our demo sample

10000000
01000000
00100000
00010000
00001000
00000100
00000010
00000001
00000000

Those are all the possibilities. There are 256 possible sequences of 8
zeros and ones, but only 9 are possible for the ballot. So, we should be
able to map worse case 4 bits to these nine patterns

0000 = 10000000
0001 = 01000000
0010 = 00100000
0011 = 00010000
0100 = 00001000
0101 = 00000100
0110 = 00000010
0111 = 00000001
1000 = 00000000

In other words, for ranked preference treat each of the N candidates as a
contest with N choices (or blank).

Alan D.
==================================================================
= 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:01 2004

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