11,666 research outputs found
The Likelihood Encoder for Lossy Source Compression
In this work, a likelihood encoder is studied in the context of lossy source
compression. The analysis of the likelihood encoder is based on a soft-covering
lemma. It is demonstrated that the use of a likelihood encoder together with
the soft-covering lemma gives alternative achievability proofs for classical
source coding problems. The case of the rate-distortion function with side
information at the decoder (i.e. the Wyner-Ziv problem) is carefully examined
and an application of the likelihood encoder to the multi-terminal source
coding inner bound (i.e. the Berger-Tung region) is outlined.Comment: 5 pages, 2 figures, ISIT 201
The Likelihood Encoder for Lossy Compression
A likelihood encoder is studied in the context of lossy source compression.
The analysis of the likelihood encoder is based on the soft-covering lemma. It
is demonstrated that the use of a likelihood encoder together with the
soft-covering lemma yields simple achievability proofs for classical source
coding problems. The cases of the point-to-point rate-distortion function, the
rate-distortion function with side information at the decoder (i.e. the
Wyner-Ziv problem), and the multi-terminal source coding inner bound (i.e. the
Berger-Tung problem) are examined in this paper. Furthermore, a non-asymptotic
analysis is used for the point-to-point case to examine the upper bound on the
excess distortion provided by this method. The likelihood encoder is also
related to a recent alternative technique using properties of random binning
Joint Source-Channel Secrecy Using Hybrid Coding
The secrecy performance of a source-channel model is studied in the context
of lossy source compression over a noisy broadcast channel. The source is
causally revealed to the eavesdropper during decoding. The fidelity of the
transmission to the legitimate receiver and the secrecy performance at the
eavesdropper are both measured by a distortion metric. Two achievability
schemes using the technique of hybrid coding are analyzed and compared with an
operationally separate source-channel coding scheme. A numerical example is
provided and the comparison results show that the hybrid coding schemes
outperform the operationally separate scheme.Comment: 5 pages, 1 figure, ISIT 201
Lossy Compression with Near-uniform Encoder Outputs
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\'{a}cs-K\"{o}rner
common information.Comment: Submitted to the 2016 IEEE International Symposium on Information
Theory (11 Pages, 3 Figures
- …