1. On Suboptimality of the Berger-Tung Bounds

    The Berger-Tung inner and outer bounds give a approximation to the rate-distortion region in lossy distributed source coding. The regions are not tight in general. Their tightness is discussed throughout Chapter 12 of Network Information Theory by El Gamal and Kim (in particular Section 12.5), but even so I …

  2. Source Encoders as Channels

    It is well known that a rate-distortion-optimal source encoder's output generally doesn't match its source's distribution. This can make some analyses a pain in the neck. For example, say you want to investigate the relationship between a signal that appears in a source, and that signal's appearance in an encoding …

  3. Combinatoral Iteration in Matlab

    Often we need a to write a program that iterates over all combinations of k elements from some set (elements chosen without replacement). It isn't obvious how to efficiently traverse through all these sets, although if bitwise arithmetic is readily available one can use Gosper's Hack. This kind of …

  4. Some Interaction Information Examples

    Interaction information between three random variables has a much less immediate interpretation compared to other information quantities. This makes it more tricky to work with. An i.i. term I(X;Y;Z) between X,\ Y and Z, could be either negative:

    If …

« Page 2 / 3 »