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

Simple data compression by redundancy replacement (Corresp.)

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

4 Author(s)

A redundancy replacement system is described. Whenevermbits of ann-bit word are identical with corresponding bits in the preceding word, these bits are replaced bymbits from a second source. An extra bit is added to each word to signal the substitution. If words withmredundant bits occur with probabilityP(m), one gains an extra channel of average capacitymP(m) -- 1. The system is analyzed as a data compressor that enhances the source entropy by replacing redundancies. An effective data compression of 2.11 is obtained for typical voice sources.

Published in:

Information Theory, IEEE Transactions on  (Volume:17 ,  Issue: 4 )

Date of Publication:

Jul 1971

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.