From: gautier_niouzes@hotmail.com
Subject: Length-Limited Huffman Coding
Date: Sat, 6 Feb 2016 12:57:06 -0800 (PST)
Date: 2016-02-06T12:57:06-08:00 [thread overview]
Message-ID: <dbe61aeb-91f9-4105-91d5-2bbe74e31ae0@googlegroups.com> (raw)
Hello,
Does someone here knows of an Ada implementation of length-limited Huffman coding ? Basically it is the construction of a Huffman tree with a constraint of a limited tree depth (or code length, if you consider the code formed by walking through the tree). References seem to point to two algorithms [1] and [2] which reduces the memory space needed, compared to [1]. Actually [1] would already be OK for my needs ("Dynamic Deflate" compression in Zip-Ada).
TIA
_________________________
Gautier's Ada programming
http://sf.net/users/gdemont/
[1] A Fast Algorithm for Optimal Length-Limited Huffman Codes
Larmore & Hirschberg
[2] A Fast and Space-Economical Algorithm for Length-Limited Coding
Katajainen, Moffat & Turpin
next reply other threads:[~2016-02-06 20:57 UTC|newest]
Thread overview: 7+ messages / expand[flat|nested] mbox.gz Atom feed top
2016-02-06 20:57 gautier_niouzes [this message]
2016-02-08 21:20 ` Length-Limited Huffman Coding gautier_niouzes
2016-02-10 11:29 ` gautier_niouzes
2016-02-11 1:59 ` Randy Brukardt
2016-02-11 9:48 ` gautier_niouzes
2016-02-11 18:44 ` Tero Koskinen
2016-02-11 22:08 ` Randy Brukardt
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox