Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

IPL
2002

favoriteEmaildiscussreport

59views more IPL 2002»

An efficient decoding technique for Huffman codes

13 years 4 months ago

An efficient decoding technique for Huffman codes

Download www.cse.cuhk.edu.hk

We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure proposed by Chen et al. [Inform. Process. Lett. 69 (1999) 119

Rezaul Alam Chowdhury, M. Kaykobad, Irwin King

Real-time Traffic

Adjacent External Nodes | Circular Leaf | Huffman Tree | IPL 2002 |

claim paper

Related Content

» Efficient Representation and Decoding of Static Huffman Code Tables in a Very Low Bit Rate...

» On the Implementation of MinimumRedundancy Prefix Codes

» ReservedLength Prefix Coding

» Rateless codes network coding for simple and efficient P2P video streaming

» SpaceEfficient Private Search with Applications to Rateless Codes

» An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes

» Automated generation of an efficient MPEG4 Reconfigurable Video Coding decoder implementat...

» A DynamicallyReconfigurable PowerEfficient Turbo Decoder

» A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	IPL
Authors	Rezaul Alam Chowdhury, M. Kaykobad, Irwin King

Comments (0)