By Topic

An improvement of dynamic Huffman coding with a simple repetition finder

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yokoo, H. ; Dept. of Comput. Sci., Gunma Univ., Japan

A mixed-mode file compression scheme that incorporates interval encoding for finding duplicate occurrences of strings without storing or parsing the past sequence and a one-pass scheme for dynamic Huffman codes is presented. Results from experiments performed on various types of files are discussed. The proposed method runs in linear time, and the memory requirement depends only on the alphabet size. The code efficiency is compared experimentally to that of other schemes

Published in:

Communications, IEEE Transactions on  (Volume:39 ,  Issue: 1 )