The likelihood encoder for source coding

Cuff, Paul; Song, Eva C.

doi:10.1109/itw.2013.6691298

Cited by 14 publications

(28 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Theorem 1: Near-uniform encoder output is achievable in the Wyner-Ziv problem at rates R ≥ R W Z (∆). Proof: The proof builds codes based on channel resolvability [6, p. 404] and the likelihood encoder [7], which allow us to track the distribution of the encoder output more readily than when using the covering lemma. We first pick a channel Q W |X such that:…”

Section: A Near-uniform Wyner-ziv Codingmentioning

confidence: 99%

See 1 more Smart Citation

Lossy compression with near-uniform encoder outputs

Vellambi

Kliewer

Bloch

2016

2016 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

It is well known that lossless compression of a discrete memoryless source with near-uniform encoder output is possible at a rate above its entropy if and only if the encoder is randomized. This work focuses on deriving conditions for near-uniform encoder output(s) in the Wyner-Ziv and the distributed lossy compression problems. We show that in the Wyner-Ziv problem, near-uniform encoder output and operation close to the WZ-rate limit is simultaneously possible, whereas in the distributed lossy compression problem, jointly near-uniform outputs is achievable in the interior of the distributed lossy compression rate region if the sources share non-trivial Gács-Körner common information. Index TermsRate-distortion, Slepian-Wolf problem, Wyner-Ziv problem, distributed lossy source coding.

show abstract

Section: A Near-uniform Wyner-ziv Codingmentioning

confidence: 99%

“…The proofs for both problems employ ideas from channel resolvability [6, p. 404] and the likelihood encoder [7]. The result for the distributed lossy compression case is proven without needing a characterization of the underlying rate region.…”

Section: Introductionmentioning

confidence: 99%

Lossy compression with near-uniform encoder outputs

Vellambi

Kliewer

Bloch

2016

2016 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

“…. , u |L| }, our goal is to construct a stochastic map ϕ : Z → L such that the joint distribution PL Z of (ϕ(Z), Z) is indistinguishable from P LZ , where P LZ is the joint distribution such that u L is sent over the channel P Z|U for the uniform random number L on L. This is done by the argument of the likelihood encoder [17] (see also [62]). However, we need to modify the argument in [17] since our goal is, in fact, to approximate a smoothed version of P LZ .…”

Section: Appendix C Simulation Of Test Channelmentioning

confidence: 99%

“…Also letZ = X per (172). Note that T c (γ c ) defined in (173) is equivalent to T WZ c (γ c ) defined in (62). Now, let us consider the stochastic map ϕ C defined in (179).…”

Section: A Code Constructionmentioning

confidence: 99%

Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information

Watanabe

Kuzuoka

Tan

2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-We present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include (i) the WynerAhlswede-Körner (WAK) problem of almost-lossless source coding with rate-limited side-information, (ii) the Wyner-Ziv (WZ) problem of lossy source coding with side-information at the decoder and (iii) the Gel'fand-Pinsker (GP) problem of channel coding with noncausal state information available at the encoder. The bounds are proved using ideas from channel simulation and channel resolvability. Our bounds for all three problems improve on all previous non-asymptotic bounds on the error probability of the WAK, WZ and GP problems-in particular those derived by Verdú. Using our novel non-asymptotic bounds, we recover the general formulas for the optimal rates of these side-information problems. Finally, we also present achievable second-order coding rates by applying the multidimensional Berry-Esséen theorem to our new non-asymptotic bounds. Numerical results show that the second-order coding rates obtained using our non-asymptotic achievability bounds are superior to those obtained using existing finite blocklength bounds.

show abstract

“…To prove achievability, we use the likelihood encoder [5]. The analysis uses an approximating distribution.…”

Section: B Inner Bound Sketchmentioning

confidence: 99%

Secrecy in cascade networks

Cuff

2013

2013 IEEE Information Theory Workshop (ITW)

Self Cite

View full text Add to dashboard Cite

We consider a cascade network where a sequence of nodes each send a message to their downstream neighbor to enable coordination, the first node having access to an information signal. An adversary also receives all the communication as well as additional side-information. The performance of the system is measured by a payoff function over all actions produced by the nodes as well as the adversary. The challenge is to maintain secrecy from the adversary in order thwart his attempt to reduce the payoff. We obtain inner and outer bounds on performance, and give examples where they are tight. From these bounds, we also derive the optimal equivocation that can be achieved in this setting, as a special case.

show abstract

The likelihood encoder for source coding

Cited by 14 publications

References 16 publications

Lossy compression with near-uniform encoder outputs

Lossy compression with near-uniform encoder outputs

Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information

Secrecy in cascade networks

Contact Info

Product

Resources

About