Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)

A redundancy replacement system is described. Whenever m bits of an n -bit word are identical with corresponding bits in the preceding word, these bits are replaced by m bits from a second source. An extra bit is added to each word to signal the substitution. If words with m redundant bits occur with probability P(m) , one gains an extra channel of average capacity mP(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 )