On Fri, 2004-04-30 at 18:58, David Mertz wrote:
> Compression as such is really just not workable. It just can't work to
> have the barcode be of indeterminate size (and possibly longer than
> usable). However, rather than -compression- we can use more optimal
> encodings of contests, thereby obtaining theoretical best sizes. It is
> not difficult to create an optimal encoding for each contest type.
As I mentioned in my prior post, compression can be achieved at a known
length by using a fixed block size encryption mechanism:
http://gnosis.python-hosting.com/voting-project/April.2004/0527.html
==================================================================
= 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