Re: Compression, encoding, entropy

From: Alan Dechert <alan_at_openvotingconsortium_dot_org>
Date: Sun May 02 2004 - 15:03:25 CDT

> Me too. I would have thought that presenting a provably optimal answer
> (along with a script to calculate it relative to a novel/historical
> election) would be a sufficient answer to stop further speculation
> (about either how to do better than optimal or on various ways to do
> worse).
>
David, have you read Arthur's paper? If so, can you comment on it?

Thanks.

Alan D.

On Aug 23, Arthur summarized,
http://gnosis.python-hosting.com/voting-project/August.2003/0237.html

> Numbers are in binary coded octal, transformed
> to make them self-delimiting. See my paper in
> http://www-db.stanford.edu/pub/keller (Arthur M.
> Keller and Jeffrey D. Ullman, "A Version Numbering
> Scheme with a Useful Lexicographical Order,"
> appeared in Int. Conf. on Data Engineering , Taipei,
> Taiwan, March 1995. Also a Postscript file), which
> includes a discussion on a self-delimiting number
> scheme. With 3 bits (it's octal, remember?), you can
> code up to 3 choices, and with 6 bits you can code
> up to 19 choices. And 9 bits can code up to 147
> choices. (If you want, you can have more short codes,
> but at the risk of making the longer codes even longer.)
> An advantage of a self-delimiting variable-length codes
> is that it makes it harder to compare votes, particularly
> if there are many votes.
>
==================================================================
= 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:03 2004

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