Related papers: Universality for the Noisy Slepian-Wolf Problem Vi…
In this paper, we explore the mystery of synchronous CDMA as applied to wireless and optical communication systems under very general settings for the user symbols and the signature matrix entries. The channel is modeled with real/complex…
Spatially extended dynamical systems, namely coupled map lattices, driven by additive spatio-temporal noise are shown to exhibit stochastic synchronization. In analogy with low-dymensional systems, synchronization can be achieved only if…
We investigate scaling and universality in nonequilibrium spin correlation functions in the presence of uncorrelated noise. In the absence of noise, spin correlation functions exhibit a crossover from monotonic decay at fast sweep…
This paper provides a statistical characterization of the individual achievable rates in bits/s/Hz and the spatial throughput of bipolar Poisson wireless networks in bits/s/Hz/m$^2$. We assume that all transmitters have a cognitive ability…
We study the problem of strong coordination of actions of two agents $X$ and $Y$ that communicate over a noisy communication channel such that the actions follow a given joint probability distribution. We propose two novel schemes for this…
This paper considers the K user cognitive interference channel with one primary and K-1 secondary/cognitive transmitters with a cumulative message sharing structure, i.e cognitive transmitter $i\in [2:K]$ knows non-causally all messages of…
Synchronization of two replicas of coupled map lattices for continuous maps is known to be in the multiplicative noise universality class. We study this transition in the presence of quenched disorder in coupling. The disorder is identical…
In this chapter, we show how the use of differential coding and the presence of phase slips in the transmission channel affect the total achievable information rates and capacity of a system. By means of the commonly used QPSK modulation,…
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…
Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about…
For finite coupling lengths, terminated spatially coupled low-density parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in conjunction…
The equivalence of peeling decoding (PD) and Belief Propagation (BP) for low-density parity-check (LDPC) codes over the binary erasure channel is analyzed. Modifying the scheduling for PD, it is shown that exactly the same variable nodes…
This work investigates the fundamental limits of communication over a noisy discrete memoryless channel that wears out, in the sense of signal-dependent catastrophic failure. In particular, we consider a channel that starts as a memoryless…
Subspace clustering is the problem of clustering data points into a union of low-dimensional linear/affine subspaces. It is the mathematical abstraction of many important problems in computer vision, image processing and machine learning. A…
In this paper, we use linear codes to study zero-error Slepian-Wolf coding of a set of sources with deviation symmetry, where the sources are generalization of the Hamming sources over an arbitrary field. We extend our previous codes,…
We consider a network of two nodes separated by a noisy channel, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of strictly causal encoding and non-causal decoding, we prove…
Recently, a new class of codes, called sparse superposition or sparse regression codes, has been proposed for communication over the AWGN channel. It has been proven that they achieve capacity using power allocation and various forms of…
We study the transmission of correlated sources over discrete memoryless (DM) multiple-access-relay channels (MARCs), in which both the relay and the destination have access to side information arbitrarily correlated with the sources. As…
Cooperative optimization is a new way for finding global optima of complicated functions of many variables. It has some important properties not possessed by any conventional optimization methods. It has been successfully applied in solving…
Interactive encoding and decoding based on binary low-density parity-check codes with syndrome accumulation (SA-LDPC-IED) is proposed and investigated. Assume that the source alphabet is $\mathbf{GF}(2)$, and the side information alphabet…