An efficient decoding technique for Huffman codes

Rezaul Alam Chowdhury; M. Kaykobad; Irwin King

doi:10.1016/S0020-0190(01)00243-5

An efficient decoding technique for Huffman codes

Rezaul Alam Chowdhury
, M. Kaykobad
, Irwin King

Computer Science

Bangladesh University of Engineering and Technology
Chinese University of Hong Kong

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

A data structure for Huffman coding was presented. The data structure involved the sending of codes of all circular leaf nodes in addition to the sending of symbols in order of appearance in the Huffman tree. The number of codes of all circular leaf nodes was bounded above by half the number of symbols. Memory efficient data structure was used to decode the text.

Original language	English
Pages (from-to)	305-308
Number of pages	4
Journal	Information Processing Letters
Volume	81
Issue number	6
DOIs	https://doi.org/10.1016/S0020-0190(01)00243-5
State	Published - Mar 31 2002

Keywords

Complete binary tree
Data structures
Static Huffman code

Access to Document

10.1016/S0020-0190(01)00243-5

Cite this

@article{d0f61050d3f74152a6246327d916b399,

title = "An efficient decoding technique for Huffman codes",

abstract = "A data structure for Huffman coding was presented. The data structure involved the sending of codes of all circular leaf nodes in addition to the sending of symbols in order of appearance in the Huffman tree. The number of codes of all circular leaf nodes was bounded above by half the number of symbols. Memory efficient data structure was used to decode the text.",

keywords = "Complete binary tree, Data structures, Static Huffman code",

author = "Chowdhury, \{Rezaul Alam\} and M. Kaykobad and Irwin King",

year = "2002",

month = mar,

day = "31",

doi = "10.1016/S0020-0190(01)00243-5",

language = "English",

volume = "81",

pages = "305--308",

journal = "Information Processing Letters",

issn = "0020-0190",

number = "6",

}

TY - JOUR

T1 - An efficient decoding technique for Huffman codes

AU - Chowdhury, Rezaul Alam

AU - Kaykobad, M.

AU - King, Irwin

PY - 2002/3/31

Y1 - 2002/3/31

N2 - A data structure for Huffman coding was presented. The data structure involved the sending of codes of all circular leaf nodes in addition to the sending of symbols in order of appearance in the Huffman tree. The number of codes of all circular leaf nodes was bounded above by half the number of symbols. Memory efficient data structure was used to decode the text.

AB - A data structure for Huffman coding was presented. The data structure involved the sending of codes of all circular leaf nodes in addition to the sending of symbols in order of appearance in the Huffman tree. The number of codes of all circular leaf nodes was bounded above by half the number of symbols. Memory efficient data structure was used to decode the text.

KW - Complete binary tree

KW - Data structures

KW - Static Huffman code

UR - https://www.scopus.com/pages/publications/0037204522

U2 - 10.1016/S0020-0190(01)00243-5

DO - 10.1016/S0020-0190(01)00243-5

M3 - Article

AN - SCOPUS:0037204522

SN - 0020-0190

VL - 81

SP - 305

EP - 308

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

An efficient decoding technique for Huffman codes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this