Remark on ``Algorithm 673: Dynamic Huffman coding

DOI10.1145/2740959MaRDI QIDQ2828174zbMATH OpenOpenAlexWikidataFDO

Authors Alexander Novoselsky, Eugene Kagan

Publication date 24 October 2016

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2740959

zbMATH Keywords

dynamic Huffman coding

Mathematics Subject Classification ID

General theory of computer systems (68M01) Distributed algorithms (68W15) Information theory (general) (94A15)

Recommendations

• Algorithm 673
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Remark on Algorithm 815
• Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders
• Dynamic huffman coding

Cites work

• Algorithm 673
• Design and analysis of dynamic Huffman codes

Cited in

(1)

• Remark on Algorithm 815

Describes a project that uses

Uses Software

• Matlab
• Algorithm 673

This page was built for publication: Remark on ``Algorithm 673: Dynamic Huffman coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828174)