Design and analysis of dynamic Huffman codes
From MaRDI portal
Publication:3778663
DOI10.1145/31846.42227zbMath0637.94002MaRDI QIDQ3778663
Publication date: 1987
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/31846.42227
entropy; distributed computing; file compression; one-pass algorithm for constructing dynamic Huffman codes; online encoding/decoding in data networks
Related Items
Optimal Prefix Codes And Huffman Codes, Optimal synchronous coding, Is Huffmann coding dead?, An efficient decoding technique for Huffman codes