Structural Properties of Optimal Test Channels for Distributed Source Coding with Decoder Side Information for Multivariate Gaussian Sources with Square-Error Fidelity
This paper focuses on the structural properties of test channels, of Wyner's operational information rate distortion function (RDF), $\overline{R}(Δ_X)$, of a tuple of multivariate correlated, jointly independent and identically distributed Gaussian random variables (RVs), $\{X_t, Y_t\}_{t=1}^\infty$, $X_t: Ω\rightarrow {\mathbb R}^{n_x}$, $Y_t: Ω\rightarrow {\mathbb R}^{n_y}$, with average mean-square error at the decoder, $\frac{1}{n} {\bf E}\sum_{t=1}^n||X_t - \widehat{X}_t||^2\leq Δ_X$, when $\{Y_t\}_{t=1}^\infty$ is the side information available to the decoder only. We construct optimal test channel realizations, which achieve the informational RDF, $\overline{R}(Δ_X) \triangleq\inf_{{\cal M}(Δ_X)} I(X;Z|Y)$, where ${\cal M}(Δ_X)$ is the set of auxiliary RVs $Z$ such that, ${\bf P}_{Z|X,Y}={\bf P}_{Z|X}$, $\widehat{X}=f(Y,Z)$, and ${\bf E}\{||X-\widehat{X}||^2\}\leq Δ_X$. We show the fundamental structural properties: (1) Optimal test channel realizations that achieve the RDF, $\overline{R}(Δ_X)$, satisfy conditional independence, $
{\bf P}_{X|\widehat{X}, Y, Z}={\bf P}_{X|\widehat{X},Y}={\bf P}_{X|\widehat{X}}, \hspace{.2in} {\bf E}\Big\{X\Big|\widehat{X}, Y, Z\Big\}={\bf E}\Big\{X\Big|\widehat{X}\Big\}=\widehat{X} $ and (2) similarly for the conditional RDF, ${R}_{X|Y}(Δ_X) \triangleq \inf_{{\bf P}_{\widehat{X}|X,Y}:{\bf E}\{||X-\widehat{X}||^2\} \leq Δ_X} I(X; \widehat{X}|Y)$, when $\{Y_t\}_{t=1}^\infty$ is available to both the encoder and decoder, and the equality $\overline{R}(Δ_X)={R}_{X|Y}(Δ_X)$.
We study the multi-user Bayesian persuasion game between one encoder and two decoders, where the first decoder is better informed than the second decoder. We consider two perfect links, one to the first decoder only, and the other to both decoders. We consider that the encoder and both decoders are endowed with distinct and arbitrary distortion functions. We investigate the strategic source coding problem in which the encoder commits to an encoding while the decoders select the sequences of symbols that minimize their respective distortion functions. We characterize the optimal encoder distort…
We study the problem of rate-distortion-equivocation with side-information only available at the decoder when an independent private random key is shared between the sender and the receiver. The sender compresses the sequence, and the receiver reconstructs it such that the average distortion between the source and the output is limited. The equivocation is measured at an eavesdropper that intercepts the source encoded message, utilizing side-information correlated with the source and the side-information at the decoder. We have derived the entire achievable rate-distortion-equivocation region …
We provide two results concerning the optimality of the maximum mutual information (MMI) decoder. First, we prove that the error exponents of the typical random codes under the optimal maximum likelihood (ML) decoder and the MMI decoder are equal. As a corollary to this result, we also show that the error exponents of the expurgated codes under the ML and the MMI decoders are equal. These results strengthen the well known result due to Csiszár and Körner, according to which, these decoders achieve equal random coding error exponents, since the error exponents of the typical random code and the…
We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder, which are both implementable by periodically-varying finite-state machines, and the decoder is granted with access to side information, which is a noisy version of the source sequence. We first derive a lower bound on the achievable expected distortion in terms of the empirical statistics of the source sequence, the number of states of the encoder, the number o…
We consider the problem of (almost) lossless source coding of two correlated memoryless sources using separate encoders and a joint decoder, that is, Slepian-Wolf (S-W) coding. In our setting, the encoding and decoding are asynchronous, i.e., there is a certain relative delay between the two sources. Neither the source parameters nor the relative delay are known to the encoders and the decoder. Since we assume that both encoders implement standard random binning, which does not require such knowledge anyway, the focus of this work is on the decoder. Our main contribution is in proposing a univ…
Recently, Martinez-Penas and Kschischang (IEEE Trans. Inf. Theory, 2019) showed that lifted linearized Reed-Solomon codes are suitable codes for error control in multishot network coding. We show how to construct and decode lifted interleaved linearized Reed-Solomon codes. Compared to the construction by Martinez-Penas-Kschischang, interleaving allows to increase the decoding region significantly (especially w.r.t. the number of insertions) and decreases the overhead due to the lifting (i.e., increases the code rate), at the cost of an increased packet size. The proposed decoder is a list deco…
