An efficient decoding technique for Huffman codes
type: Item
instance of: scholarly article
title: An efficient decoding technique for Huffman codes
zbMATH Open document ID: 1013.68067
DOI: 10.1016/S0020-0190(01)00243-5
author: Rezaul Alam Chowdhury
author: Irwin King
author: Mohammad Kaykobad
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1767645
zbMATH Keywords: static Huffman code
zbMATH Keywords: data structures
zbMATH Keywords: complete binary tree
MaRDI profile type: Publication
cites work: A memory-efficient and fast Huffman decoding algorithm
cites work: Efficient Huffman decoding
cites work: Memory efficient and high-speed search Huffman coding
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: Huffman codes and self-information
cites work: The length of a typical Huffman codeword
cites work: Design and analysis of dynamic Huffman codes
full work available at URL: s0020-0190(01)00243-5
OpenAlex ID: W2103247055
description: scientific article; zbMATH DE number 1767645