By Topic

Universal Lossless Compression of Erased Symbols

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

2 Author(s)
Jiming Yu ; Dept. of Electr. Eng., Princeton Univ., Princeton, NJ ; Verdu, S.

A source X goes through an erasure channel whose output is Z. The goal is to compress losslessly X when the compressor knows X and Z and the decompressor knows Z. We propose a universal algorithm based on context-tree weighting (CTW), parameterized by a memory-length parameter. We show that if the erasure channel is stationary and memoryless, and X is stationary and ergodic, then the proposed algorithm achieves a compression rate of H(X 0|X - l -1, Z l) bits per erasure.

Published in:

Information Theory, IEEE Transactions on  (Volume:54 ,  Issue: 12 )