Article View: rec.games.programmer
Article #1179Re: Fast compression
From: Mark S. Wyman
Date: Thu, 12 Nov 1992 15:44
Date: Thu, 12 Nov 1992 15:44
17 lines
1101 bytes
1101 bytes
gardabr@unix1 (Gard Eggesbo Abrahamsen) writes: >Chris (cbusch@ub.d.umn.edu) wrote: >: Hello >: What is the fastest compression technique? >The fastest compression techique is probably coding in this form: >if bit 7 is cleared, the following n bytes are to be read directly. >if bit 7 is set, the copy the next byte n times. >This is FAST but a really crappy packing, and you REALLY shouldn't use it. >: Chris Busch CBUSCH@ub.d.umn.edu Look at the latest C Users Journal mag. It has a compression algo that is combination run length encoding and pattern searching. Seems quite fast. Mark Wyman
Technical Details
Message-ID:
<wyman.721583047@opal8>Path:
arc1-ca.pugleaf.net!sparky!uunet!panther!mothost!white!sapphire.rtsg.mot.com!opal8!wymanReferences:
<1dmqvsINN497@ub.d.umn.edu> <1992Nov10.122535.27889@ugle.unit.no>Show Full Headers
Complete Article Headers
Newsgroups: rec.games.programmer Path: arc1-ca.pugleaf.net!sparky!uunet!panther!mothost!white!sapphire.rtsg.mot.com!opal8!wyman From: wyman@rtsg.mot.com (Mark S. Wyman) Subject: Re: Fast compression Message-ID: <wyman.721583047@opal8> Sender: news@rtsg.mot.com Nntp-Posting-Host: opal8 Organization: Motorola Inc., Cellular Infrastructure Group References: <1dmqvsINN497@ub.d.umn.edu> <1992Nov10.122535.27889@ugle.unit.no> Distribution: na Date: Thu, 12 Nov 1992 15:44:07 GMT Lines: 17