From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 X-Received: by 10.66.141.102 with SMTP id rn6mr19808141pab.26.1454792227002; Sat, 06 Feb 2016 12:57:07 -0800 (PST) X-Received: by 10.182.42.195 with SMTP id q3mr366554obl.3.1454792226965; Sat, 06 Feb 2016 12:57:06 -0800 (PST) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!news.glorb.com!o2no2753549iga.0!news-out.google.com!l1ni5059igd.0!nntp.google.com!hb3no1494371igb.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Sat, 6 Feb 2016 12:57:06 -0800 (PST) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=2a02:1205:c690:5a50:58b8:4df2:c8cc:ae5f; posting-account=gRqrnQkAAAAC_02ynnhqGk1VRQlve6ZG NNTP-Posting-Host: 2a02:1205:c690:5a50:58b8:4df2:c8cc:ae5f User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Length-Limited Huffman Coding From: gautier_niouzes@hotmail.com Injection-Date: Sat, 06 Feb 2016 20:57:06 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Xref: news.eternal-september.org comp.lang.ada:29380 Date: 2016-02-06T12:57:06-08:00 List-Id: 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 constrai= nt 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).=20 TIA _________________________=20 Gautier's Ada programming=20 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