Y Coding

Article View: gnu.misc.discuss

Article #72024

#72024

From: Mitchell N. Perilstein
Date: Tue, 12 May 1992 10:56

14 lines
1104 bytes

A long while back, Dan Bernstein posted to g.m.d an outline for a
compression algorithm he called Y coding (for .Y instead of .Z?):

> For the record, I found Y coding December 26. It gives slightly better
> results than LZW and codes somewhat faster than AP. On the other hand,
> decompression is about as slow as compression and uses more memory.

Has anyone produced working code that realizes this claim? If so, would 
such be an acceptable LZW replacement? 

---
 Mitchell N. Perilstein
 CAD Language Systems, Inc. / Rockville, MD 20879-3344 / 301-963-5200
 (We're moving 5/18/92 to Columbia, MD 21045 / 410-992-5700)

Technical Details

Message-ID: <MITCH.92May12105623@spica.clsi>

Path: arc1-ca.pugleaf.net!sparky!uunet!clsi!mitch

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 1025b4,2ebb5eadbf29a7b,start
X-Google-Attributes: gid1025b4,public
X-Google-ArrivalTime: 1992-05-12 03:46:28 PST
Newsgroups: gnu.misc.discuss
Path: arc1-ca.pugleaf.net!sparky!uunet!clsi!mitch
From: mitch@clsi (Mitchell N. Perilstein)
Subject: Y Coding
Message-ID: <MITCH.92May12105623@spica.clsi>
Sender: usenet@clsi.COM
Organization: CAD Language Systems, Inc.
Distribution: gnu
Date: 12 May 92 10:56:23
Lines: 15