4 search results - page 1 / 1 » Universal Lossless Compression of Erased Symbols |
TIT
2008
13 years 4 months ago
2008
A source XXX goes through an erasure channel whose output is ZZZ. The goal is to compress losslessly XXX when the compressor knows XXX and ZZZ and the decompressor knows ZZZ. We pr...
TIT
2008
13 years 4 months ago
2008
Abstract--We consider sources and channels with memory observed through erasure channels. In particular, we examine the impact of sporadic erasures on the fundamental limits of los...
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
We consider a first-order Markov source, which is predictively encoded using a DPCM-style encoder. The quantized compressed prediction residual is transmitted over an erasure chan...
TIT
2011
12 years 11 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...