Efficient Huffman decoding

DOI10.1016/S0020-0190(96)00204-9zbMATH Open1336.68045MaRDI QIDQ286977FDOQ286977

Authors: Kuo-Liang Chung 

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

data structuresdecoding algorithmsHuffman code

Mathematics Subject Classification ID

Data structures (68P05) Decoding (94B35)

Cites Work

• Title not available (Why is that?)
• Memory efficient and high-speed search Huffman coding
• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes

Cited In (9)

• An efficient bitwise Huffman coding technique based on source mapping.
• An efficient decoding technique for Huffman codes
• Fixed-prefix encoding of the integers can be Huffman-optimal
• An efficient finite-state machine implementation of Huffman decoders
• Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders
• A memory-efficient and fast Huffman decoding algorithm
• An improved algorithm for solving the banded cyclic string-to-string correction problem
• Title not available (Why is that?)
• A space-efficient Huffman decoding algorithm and its parallelism

This page was built for publication: Efficient Huffman decoding

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