Cart (Loading....) | Create Account
Close category search window

An efficient repetition finder for improving dynamic Huffman coding

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

3 Author(s)
Chia-Hsu Kuo ; Network Planning Lab., Chunghwa Telecom Co. Ltd., Taiwan ; Mu-King Tsay ; Cheng-Chang Lu

In this paper, a new repetition finder to be used with dynamic Huffman (1952) coding is proposed to improve the compression efficiency by reducing the redundancy due to string repetitions. Compared to the repetition finder proposed by Yokoo (1991), the proposed scheme effectively increases the numbers of consecutive symbols in the repetition mode and the total number of symbols in the repetition mode. Experimental results show that the proposed method outperforms the repetition finder of Yokoo by 14-40% in compression ratios with about the same memory requirement and running time

Published in:

Communications, IEEE Transactions on  (Volume:45 ,  Issue: 11 )

Date of Publication:

Nov 1997

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.