Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Memory Efficient Data Structure For Static Huffman Tree

 

Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

 
Rs. 3,651

Availability: In stock

 
  • Product Description
 

Data compression has important application in the areas of data transmission and data storage. Many data processing applications require storage of large volumes of data. A compression is beneficial from many perspectives. It minimizes the storage requirement and required bandwidth, as well as transmission time between the encoder and decoder. Huffman encoding scheme is widely used in text, image and video compression. Many techniques have been presented since then. But still this is an important field as it significantly reduces storage requirement and communication cost. This research presented a new memory efficient data structure for the static Huffman tree. Memory efficient representation of Huffman tree increases the compression ratio of Huffman coding especially for Repeated and Block Huffman coding. Based on the memory efficient data structure, a new Huffman decoding algorithm is presented. The advantage of this decoding process is that it does not require reconstructing Huffman table or tree in the receiver end for decoding a compressed file. This type of data structures will be really applicable for low memory machines.

Product Specifications
SKU :COC17771
AuthorPankaj Bhambri and Dolly Garg
LanguageEnglish
BindingPaperback
Number of Pages68
Publishing Year6/16/2012
ISBN978-3659135262
Edition1 st
Book TypeComputing & information technology
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-27 00:00:00