12 search results - page 1 / 3 » On the Average Redundancy Rate of the Lempel-Ziv Code |
DCC
1996
IEEE
13 years 11 months ago
1996
IEEE
TIT
2008
13 years 7 months ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
TIT
2008
13 years 7 months ago
2008
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
TIT
2011
13 years 2 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...
ICIP
2010
IEEE
13 years 4 months ago
2010
IEEE
We address the joint problem of clustering heterogenous clients and allocating scalable video source rate and FEC redundancy in IPTV systems. We propose a streaming solution that ...