Article View: comp.patents
Article #14[REQUEST] Replacement for compress
From: Urban Koistinen
Date: Mon, 20 Jul 1992 16:06
Date: Mon, 20 Jul 1992 16:06
25 lines
1368 bytes
1368 bytes
In the GNU bulletin I see that a replacement for compress is wanted. I have studied some data compression techniques, mostly variants of lz and huffman + some aritmetic coding. I have even written a program that compress better than compress, although it is too slow to be of much use. (It even compressed files compressed by compress some 1-3%) ..... Speed, compression ratio, non-patented, how good must it be? Is a program with about the same capabilities as compress, but without any known (to me) patents good enough? I think a variation on huffman coding could be both fast and good enough, but how many variations on huffman coding are patented? Urban Koistinen - md85-epi@nada.kth.se Current writer of GNU Chess 5.0 - it will be great! -- Urban Koistinen - md85-epi@nada.kth.se [mod- I was under the impression that Huffman coding was not patents, but dont quote me on this...]
Technical Details
Message-ID:
<1992Jul25.025107.5666@cs.su.oz.au>Path:
arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!metro!basser.cs.su.oz.au!newsShow Full Headers
Complete Article Headers
Newsgroups: comp.patents Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!metro!basser.cs.su.oz.au!news From: md85-epi@byse.nada.kth.se (Urban Koistinen) Subject: [REQUEST] Replacement for compress Organization: Royal Institute of Technology, Stockholm, Sweden Date: Mon, 20 Jul 1992 16:06:30 GMT Approved: patents@cs.su.oz.au Message-ID: <1992Jul25.025107.5666@cs.su.oz.au> Sender: usenet@kth.se (Usenet) Nntp-Posting-Host: byse.nada.kth.se Lines: 25