Related papers: Cut-Set Bound Is Loose for Gaussian Relay Networks

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

In this paper, we study the Gaussian relay channels in the low signal-to-noise ratio (SNR) regime with the time-sharing compress-and-forward (CF) scheme, where at each time slot all the nodes keep silent at the first fraction of time and…

A class of diamond networks are studied where the broadcast component is modelled by two independent bit-pipes. New upper and low bounds are derived on the capacity which improve previous bounds. The upper bound is in the form of a max-min…

In this paper, we generalize the well known cut-set bound to the problem of lossy transmission of functions of arbitrarily correlated sources over a discrete memoryless multiterminal network.

In this paper, we study relay networks with orthogonal components in presence of noncausal channel state information (CSI) available at the source. We propose an upper bound on the capacity of the discrete memoryless model (DM)for the case…

We present a new outer bound for the sum capacity of general multi-unicast deterministic networks. Intuitively, this bound can be understood as applying the cut-set bound to concatenated copies of the original network with a special…

In this paper, we study the capacity of the diamond channel. We focus on the special case where the channel between the source node and the two relay nodes are two separate links with finite capacities and the link from the two relay nodes…

Deterministic identification (DI) has emerged as a promising paradigm for large-scale and goal-oriented communication systems. Despite significant progress, a fundamental open problem has remained unresolved: a persistent gap between the…

Explicit characterization of the capacity region of communication networks is a long standing problem. While it is known that network coding can outperform routing and replication, the set of feasible rates is not known in general.…

We obtain new outer bounds on the capacity regions of the two-user multiple access channel with generalized feedback (MAC-GF) and the two-user interference channel with generalized feedback (IC-GF). These outer bounds are based on the idea…

This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The…

New capacity upper bounds are presented for the discrete-time Poisson channel with no dark current and an average-power constraint. These bounds are a simple consequence of techniques developed for the seemingly unrelated problem of upper…

We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization…

In this paper, we consider full-duplex and half-duplex Gaussian relay channels where the noises at the relay and destination are arbitrarily correlated. We first derive the capacity upper bound and the achievable rates with three existing…

In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary…

In this paper, we present nontrivial upper and lower bounds on the secrecy capacity of the degraded Gaussian diamond-wiretap channel and identify several ranges of channel parameters where these bounds coincide with useful intuitions.…

This paper derives an outer bound on the capacity region of a general memoryless interference channel with an arbitrary number of users. The derivation follows from a generalization of the techniques developed by Kramer and by Etkin et al…

Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given…

For every Gaussian relay network with a single source-destination pair, it is known that there exists a corresponding deterministic network called the discrete superposition network that approximates its capacity uniformly over all SNR's to…

In multi user Gaussian relay networks, it is desirable to transmit private information to each user as well as common information to all of them. However, the capacity region of such networks with both kinds of information is not easy to…