An upper bound on the rate distortion function for source coding with partial side information at the decoder

Abstract-We investigate the network source coding rate region for networks with multiple sources and multicast demands in the presence of side information, generalizing earlier results on multicast rate regions without side information. When side information is present only at the terminal nodes, we show that the rate region is precisely characterized by the cut-set bounds and that random linear coding suffices to achieve the optimal performance. When side information is present at a non-terminal node, we present an achievable region. Finally, we apply these results to obtain an inner bound on the rate region for networks with general source-demand structures.

show abstract

“…The above can be seen by combining the binning argument of [5] (see also [6]) and the proof from Theorem 2.…”

Section: Multicast With Side Information At a Non-sink Nodementioning

confidence: 85%

“…We follow the approach of previously solved coded side-information problems (cf. [4], [5], [6]) in designing the codeword using each U τ .…”

Section: Multicast With Side Information At a Non-sink Nodementioning

confidence: 99%

On achievable rates for multicast in the presence of side information

Bakshi

Effros

2008

2008 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…Later in [15], the same result was extended to the Wyner-Ziv problem, and to the partial side information problem [9]. The above result was crucially dependent on the fact that the convex core region that sweep out the overall inner bound is an orthant.…”

Section: Introductionmentioning

confidence: 86%

“…Hence we obtain the following result. 9) and direction cosine vector a {J+1,...,M +L} varies through admissible values.…”

Section: (As It Is (35) Corresponds To Identity Permutation)mentioning

confidence: 99%

“…Specifically, coincident inner and outer bounds have been found for the aforementioned problems. However, in certain other source coding problems, including the Berger-Tung and the partial side information problems [8,9], coincident inner and outer bounds have not been found. In this paper, we shall consider a general class of inner bounds, which we call canonical, and which may or may not be tight [10].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Alphabet sizes of auxiliary random variables in canonical inner bounds

Jana

2009

2009 43rd Annual Conference on Information Sciences and Systems

View full text Add to dashboard Cite

Alphabet size of auxiliary random variables in our canonical description is derived.Our analysis improves upon estimates known in special cases, and generalizes to an arbitrary multiterminal setup. The salient steps include decomposition of constituent rate polytopes into orthants, translation of a hyperplane till it becomes tangent to the achievable region at an extreme point, and derivation of minimum auxiliary alphabet sizes based on Caratheodory's theorem.

show abstract

Rate‐Distortion Theory

Berger

2003

Wiley Encyclopedia of Telecommunications

373

220

View full text Add to dashboard Cite

Rate‐distortion theory is the branch of information theory that treats compressing the data produced by an information source down to a specified encoding rate that is strictly less than the source's entropy. This necessarily entails some lossiness, or distortion, between the original source data and the best approximation thereto that can be produced on the basis of the encoder's output bits. Rate‐distortion theory was introduced in the seminal works written in 1948 and 1959 by C. E. Shannon , the founder of information theory. We describe Shannon's contribution and then trace its subsequent development worldwide. Heavier than usual emphasis is placed on the concept of “matching” a channel to a source in the rate‐distortion sense, and also on the analogous matching of a source to a channel. Experimental evidence has been mounting in support of the hypothesis that living organisms often simultaneously achieve both of these matchings when processing their sensory inputs, thereby eliminating the need for the complex encoding and decoding operations that are needed in order to produce an information‐theoretically optimum system in the absence of such double matching.

show abstract

An upper bound on the rate distortion function for source coding with partial side information at the decoder

Cited by 48 publications

References 3 publications

On achievable rates for multicast in the presence of side information

On achievable rates for multicast in the presence of side information

Alphabet sizes of auxiliary random variables in canonical inner bounds

Rate‐Distortion Theory

Contact Info

Product

Resources

About