The reliability function of variable-rate Slepian-Wolf coding is linked to the reliability function of channel coding with constant composition codes, through which computable lower and upper bounds are derived. The bounds coincide at rates close to the Slepian-Wolf limit, yielding a complete characterization of the reliability function in that rate regime. It is shown that variable-rate Slepia...

ii 5.2 Periodogram with Rectangular window…………………………………….26 6. SIMULATION RESULTS AND ANALYSIS……………….………………………………………….27 6.1 WINNER phase II model…………………………………………………………….27 6.2 Simulation of the channel estimation of the WINNER II channel model, Slepian basis expansion and Fourier basis expansion…….32 6.2.1 Simulations of the channel estimation of the WINNER II model and the Slepian basis expan...

We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...

We consider the model of random binning and finite–temperature decoding for Slepian–Wolf codes, from a statistical–mechanical perspective. While ordinary random channel coding is intimately related to the random energy model (REM) – a statistical–mechanical model of disordered magnetic materials, it turns out that random binning (for Slepian–Wolf coding) is analogous to another, related statist...

In the distributed function computation problem, dichotomy theorems, initiated by Han-Kobayashi, seek to classify functions by whether the rate regions for function computation improve on the Slepian-Wolf regions or not. In this paper, we develop a general approach to derive converse bounds on the distributed function computation problem. By using this approach, we recover the sufficiency part,...

We analyze the asymptotic performance of ensembles of random binning Slepian-Wolf codes, where each type class of the source might have a different coding rate. In particular, we first provide the exact encoder excess rate exponent as well as the decoder error exponent. Then, using the error exponent expression, we determine the optimal rate function, namely, the minimal rate for each type clas...

This paper is concerned with various aspects of the Slepian process (Bt+1 −Bt, t ≥ 0) derived from one-dimensional standard Brownian motion (Bt, t ≥ 0). In particular, we offer an analysis of the local structure of the Slepian zero set {t : Bt+1 = Bt}, including a path decomposition of the Slepian process for 0 ≤ t ≤ 1. We also establish the existence of a random time T ≥ 0 such that the proces...