English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We consider the problem of (almost) lossless separate encodings and joint decoding of two correlated discrete memoryless sources (DMSs), that is, the well-known Slepian-Wolf (S-W) source coding problem. Traditionally, ensembles of S&#x2013;W codes are defined such that every bin of each <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula>&#x2013;vector of each source is randomly drawn under the uniform distribution across the sets <inline-formula> <tex-math notation="LaTeX">$\{0,1,\ldots,2^{nR_{X}}-1\}$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$\{0,1,\ldots,2^{nR_{Y}}-1\}$ </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">$R_{X}$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$R_{Y}$ </tex-math></inline-formula> are the coding rates of the two sources, <inline-formula> <tex-math notation="LaTeX">$X$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$Y$ </tex-math></inline-formula>, respectively. In a few more recent works, where only one source, say, <inline-formula> <tex-math notation="LaTeX">$X$ </tex-math></inline-formula>, is compressed and the other one, <inline-formula> <tex-math notation="LaTeX">$Y$ </tex-math></inline-formula>, serves as side information available at the decoder, the scope is extended to variable&#x2013;rate S&#x2013;W (VRSW) codes, where the rate is allowed to depend on the type class of the source string, but still, the random&#x2013;binning distribution is assumed uniform within the corresponding, type&#x2013;dependent, bin index set. In this expository work, we investigate the role of the uniformity of the random binning distribution from the perspective of the trade-off between the reliability (defined in terms of the error exponent) and the compression performance (measured from the viewpoint of the source coding exponent). To this end, we study a much wider class of random&#x2013;binning distributions, which includes the ensemble of VRSW codes as a special case, but it also goes considerably beyond. We first show that, with the exception of some pathological cases, the smaller ensemble, of VRSW codes, is as good as the larger ensemble in terms the trade-off between the error exponent and the source coding exponent. Notwithstanding this finding, the wider class of ensembles proposed is motivated in two ways. The first is that it outperforms VRSW codes in the above&#x2013;mentioned pathological cases, and the second is that it allows robustness: in the event of a system failure that causes unavailability of the compressed bit&#x2013;stream from one of the sources, it still allows reconstruction of the other source within some controllable distortion.

On More General Distributions of Random Binning for Slepian–Wolf Encoding