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.

J. Wilson

Papers

Simple data compression by redundancy replacement (Corresp.)