Path: utzoo!censor!geac!torsqnt!jarvis.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!sunic!tut!santra!tko-sony-22.hut.fi!justus
From: justus@tko-sony-22.hut.fi (Juhana R{s{nen)
Newsgroups: comp.sys.amiga.tech
Subject: Re: Huffman Encoding Scheme
Message-ID: <1990Feb26.112044.17219@santra.uucp>
Date: 26 Feb 90 11:20:44 GMT
References: <2941@dciem.dciem.dnd.ca>
Sender: news@santra.uucp (Cnews - USENET news system)
Reply-To: justus@niksula.hut.fi (Juhana R{s{nen)
Organization: Helsinki University of Technology, Finland
Lines: 21

In article <2941@dciem.dciem.dnd.ca> ckc@dretor (Raymond Cheang) writes:
>
>Hi! Can someone give me some references on huffman encoding scheme.
>Is there any PD examples available?  

(1) Abelson & Sussman: Structure and Interpretation of Computer Programs,
    MIT Press 1985

    Contains some basic theory of Huffman encoding and an implementation in
    scheme (a dialect of lisp :-)); pp. 118-125. But this is a mere example
    of data abstractions in scheme, more detailed information can be found in


(2) Richard Hamming: Coding and information theory (1980)

    I haven't read this myself, but (1) had a reference to this, and said
    that (2) should contain discussion of the mathematical properties of
    Huffman codes.
   

	Juhana R{s{nen / justus@niksula.hut.fi