Universal Decoding for Asynchronous Slepian-Wolf Encoding

Merhav, Neri

doi:10.1109/itw46852.2021.9457597

Cited by 2 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, as explained in the Introduction, the ensemble of VRSW codes, with rate functions R X ( Px ) and R Y ( Py ), corresponds to the special case of (1), where F ( Pux ) = H( Pu ) and G( Pyv ) = H( Pv ), with Pu and Pv being chosen such that H( Pu ) = R X ( Px ) and H( Pv ) = R Y ( Py ). 7 5 Using General Random Binning Channels for Robustness…”

Section: The Excess Code-length Exponent Is Given Bymentioning

confidence: 99%

“…where the inequality is due to the fact that we have analyzed a sub-optimal decoder, whereas E err (A, B) is defined for the optimal, MAP decoder (4). A matching lower bound, of the same exponential order, is obtained by analyzing the error probability for a given (u, v, x, y) under the MAP decoder, where the inner summation over {(x ′ , y ′ )} is confined to the same conditional type as that of (x, y) given (u, v) (where P (x ′ , y ′ ) = P (x, y) and A(u|x ′ ) = A(u|x)), see, [7] where the same idea was used as well. Since the sub-optimal decoding metric (58) cannot be better than the MAP decoding metric, a simple sandwich argument yields that the last inequality is, in fact, an equality:…”

Section: Pecl =mentioning

confidence: 99%

See 1 more Smart Citation

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

Merhav¹

2020

Preprint

Self Cite

View full text Add to dashboard Cite

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-W codes are defined such that every bin of each n-vector of each source is randomly drawn under the uniform distribution across the sets {0, 1, . . . , 2 nRX − 1} and {0, 1, . . . , 2 nRY − 1}, where R X and R Y are the coding rates of the two sources, X and Y , respectively. In a few more recent works, where only one source, say, X, is compressed and the other one, Y , serves as side information available at the decoder, the scope is extended to variable-rate S-W (VRSW) codes, where the rate is allowed to depend on the type class of the source string, but still, the random-binning distribution is assumed uniform within the corresponding, type-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-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-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-stream from one of the sources, it still allows reconstruction of the other source within some controllable distortion.

show abstract

Section: The Excess Code-length Exponent Is Given Bymentioning

confidence: 99%

Section: Pecl =mentioning

confidence: 99%