Re: DUDE-8, a compression proposal

2001-06-25 Thread Markus Scherer
John Cowan wrote: 5. Emit all non-zero bytes. Do you mean omit leading zeroes and emit following bytes? You would not want to emit all but a middle byte, right? markus

Re: DUDE-8, a compression proposal

2001-06-25 Thread John Cowan
Markus Scherer scripsit: John Cowan wrote: 5. Emit all non-zero bytes. Do you mean omit leading zeroes and emit following bytes? You would not want to emit all but a middle byte, right? Yes, of course *assumes paper bag* -- John Cowan [EMAIL

Re: DUDE-8, a compression proposal

2001-06-23 Thread Mark Davis
. That can also be done, with a little bit more work. Left to the reader. Mark - Original Message - From: John Cowan [EMAIL PROTECTED] To: [EMAIL PROTECTED] Sent: Friday, June 22, 2001 18:23 Subject: DUDE-8, a compression proposal It's DUDE-8! It's quick! It's easy! It does it all

DUDE-8, a compression proposal

2001-06-22 Thread John Cowan
It's DUDE-8! It's quick! It's easy! It does it all! The DUDE-8 algorithm compresses 21-bit Unicode Scalar Values into bytes. It is based on the DUDE(-6) algorithm currently being proposed for i18n of DNS names. 1. Let prev = 0. 2. For each Unicode Scalar value usv, let prev = prev xor USV.