This thesis is concerned with problems in decentralized communication in large networks. Namely, we address the problems of joint rate allocation and transmission of data sources measured at nodes, and of controlling the multiple access of sources to a shared medium. In our study, we consider in particular the important case of a sensor network measuring correlated data. In the first part of th...

Wyner–Ziv (WZ) video coding—a particular case of distributed video coding (DVC)—is a new video coding paradigm based on two major Information Theory results: the Slepian–Wolf and Wyner–Ziv theorems. In recent years, some practical WZ video coding solutions have been proposed with promising results. One of the most popular WZ video coding architectures in the literature uses turbo codes based Sl...

We show that the operator norm of an arbitrary bivariate polynomial, evaluated on certain spectral projections spin operators, converges to maximal value in semiclassical limit. contrast this limiting behavior with polynomial when random pairs projections. The discrepancy is a consequence type Slepian concentration phenomenon, which we prove some cases.

where ω = vk and k± = k x̂ ± kΓ ŷ. Slepian also noted that if v < c, then cos(kΓy) = cosh(kΓ′y) where Γ′ = iΓ = √ 1− v2/c2, and the waveform (1) again propagates with speed v. The vector potential (1), together with scalar potential V = 0, satisfy the conditions for the Coulomb, Gibbs, Lorenz and velocity gauges. See, for example, [2]. For completeness, the electric field is E = iωA ≡ E+ + E− wh...

The aim of this paper is to prove theorems for the Slepian-Wolf source coding and the broadcast channel coding (independent messages and no common message) based on the the notion of a stronger version of the hash property for an ensemble of functions. Since an ensemble of sparse matrices has a strong hash property, codes using sparse matrices can realize the achievable rate region. Furthermore...

This paper proposes a practical coding scheme for the Slepian-Wolf problem of separate encoding of correlated sources. Finite-state machine (FSM) encoders, concatenated in parallel, are used at the transmit side and an iterative turbo decoder is applied at the receiver. Simulation results of system performance are presented for binary sources with different amounts of correlation. Obtained resu...