The robustness property can be added to DSC system at the expense of reducing performance, i.e., increasing the sum-rate. The aim of designing robust DSC schemes is to trade off between system robustness and compression efficiency. In this paper, after deriving an inner bound on the rate–distortion region for the quadratic Gaussian MDC based RDSC system with two encoders, the structure of...

Given a set of n points in `1, how many dimensions are needed to represent all pairwise distances within a specific distortion? This dimension-distortion tradeoff question is well understood for the `2 norm, where O((logn)/ ) dimensions suffice to achieve 1 + distortion. In sharp contrast, there is a significant gap between upper and lower bounds for dimension reduction in `1. A recent result s...

We obtain minimax lower and upper bounds for the expected distortion redundancy of empirically designed vector quantizers. We show that the mean-squared distortion of a vector quantizer designed from n independent and identically distributed (i.i.d.) data points using any design algorithm is at least (n ) away from the optimal distortion for some distribution on a bounded subset of R. Together ...

Although Shannon introduced the concept of a rate distortion function in 1948, only in the last decade has the methodology for developing rate distortion function lower bounds for real-world sources been established. However, these recent results have not been fully exploited due to some confusion about how these new rate distortion bounds, once they are obtained, should be interpreted and shou...

the robustness property can be added to dsc system at the expense of reducing performance, i.e., increasing the sum-rate. the aim of designing robust dsc schemes is to trade off between system robustness and compression efficiency. in this paper, after deriving an inner bound on the rate–distortion region for the quadratic gaussian mdc based rdsc system with two encoders, the structure of the r...

We derive a lower bound on the differential entropy of a log-concave random variable X in terms of the p-th absolute moment of X. The new bound leads to a reverse entropy power inequality with an explicit constant, and to new bounds on the rate-distortion function and the channel capacity. Specifically, we study the rate-distortion function for log-concave sources and distortion measure |x− x̂|,...

Rate-distortion bounds for scalable coding, and conditions under which they coincide with nonscalable bounds, have been extensively studied. These bounds have been derived for the general tree-structured refinement scheme, where reproduction at each layer is an arbitrarily complex function of all encoding indexes up to that layer. However, inmost practical applications (e.g., speech coding) “ad...