Compression algorithms

Article View: alt.msdos.programmer

Article #644

Back to alt.msdos.programmer Previous Next

#644

From: Robert Schmidt
Date: Mon, 28 Sep 1992 13:59

27 lines
1463 bytes

Hi!

As a part of my Data structures and Algorithms course, I came across
the Huffman algorithm for finding an optimal, variable-length coding tree,
for compressing data.

I implemented this using C++ classes (a heap and a binary tree), and although
it was fast, the compression ratio didn't impress me much, as you can
well imagine.

I was wondering if anyone have assembler, pascal, c or c++ sources for
compression.  I'll appreciate anything, even if it doesn't compress
very good, or is very slow.  I've used run-length encoding before, and have
glanced at LZ coding.

If I get enough nice replies, I'll collect them and send them to some binary
archives or ftp sites (if such collections doesn't exist already, of course).

And one more thing:  Please reply via e-mail!


-- 
Cheers from Robert Schmidt, aka Ztiff Zox, aka Buuud (IRC).  E-mail to 
robert@solan.unit.no, snail-mail to Stud.techn. Robert Schmidt, Stud.post 170,
Norwegian Institute of Technology, 7034 Trondheim, NORWAY          

Warlords: Now do you think my .sig is boring enough?

Technical Details

Message-ID: <1992Sep28.135957.610@ugle.unit.no>

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!ugle.unit.no!solan1.solan.unit.no!robert

Show Full Headers

Complete Article Headers

Newsgroups: alt.msdos.programmer
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!ugle.unit.no!solan1.solan.unit.no!robert
From: robert@solan.unit.no (Robert Schmidt)
Subject: Compression algorithms
Message-ID: <1992Sep28.135957.610@ugle.unit.no>
Sender: news@ugle.unit.no (NetNews Administrator)
Organization: Norwegian Institute of Technology
Date: Mon, 28 Sep 92 13:59:57 GMT
Lines: 27