Related papers: A Tight Upper Bound on the Second-Order Coding Rat…
New non-asymptotic random coding theorems (with error probability $\epsilon$ and finite block length $n$) based on Gallager parity check ensemble and Shannon random code ensemble with a fixed codeword type are established for discrete input…
Consider a pair of terminals connected by two independent additive white Gaussian noise channels, and limited by individual power constraints. The first terminal would like to reliably send information to the second terminal, within a given…
The problem of determining the best achievable performance of arbitrary lossless compression algorithms is examined, when correlated side information is available at both the encoder and decoder. For arbitrary source-side information pairs,…
We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…
Feedback is shown to increase the sum-rate capacity of K-user Gaussian multiple-access channels by at most a factor of approximately 1.54, improving Thomas' doubling bound (1987). The new bound is the best possible in the sense that it can…
This paper presents a new derivation method of converse bounds on the non-asymptotic achievable rate of discrete weakly symmetric memoryless channels. It is based on the finite blocklength statistics of the channel, where with the use of an…
The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable…
In 1975, Carleial presented a special case of an interference channel in which the interference does not reduce the capacity of the constituent point-to-point Gaussian channels. In this work, we show that if the inequalities in the…
In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…
We consider channel coding for Gaussian channels with the recently introduced mean and variance cost constraints. Through matching converse and achievability bounds, we characterize the optimal first- and second-order performance. The main…
We propose two types of universal codes that are suited to two asymptotic regimes when the output alphabet is possibly continuous. The first class has the property that the error probability decays exponentially fast and we identify an…
We provide a counterexample to Cover's conjecture that the feedback capacity $C_\textrm{FB}$ of an additive Gaussian noise channel under power constraint $P$ be no greater than the nonfeedback capacity $C$ of the same channel under power…
This paper considers a Gaussian channel with one transmitter and two receivers. The goal is to maximize the communication rate at the intended/primary receiver subject to a disturbance constraint at the unintended/secondary receiver. The…
In this paper, the fundamental limits on the rates at which information and energy can be simultaneously transmitted over an additive white Gaussian noise channel are studied under the following assumptions: $(a)$ the channel is memoryless;…
This article shows that the set of HK constraints correspond to projecting the intersection of two multiple access channels on its sup-spaces. A key property of HK constraints is that the private message of user 1 (or of user 2) is the last…
In this paper, we investigate the signal shaping in a two-user discrete time memoryless Gaussian multiple-access channel (MAC) with computation. It is shown that by optimizing input probability distribution, the transmission rate per…
We study the amplitude-constrained additive white Gaussian noise channel. It is well known that the capacity-achieving input distribution for this channel is discrete and supported on finitely many points. The best known bounds show that…
In this report, the fundamental limits of simultaneous information and energy transmission in the two-user Gaussian multiple access channel (G-MAC) with and without feedback are fully characterized. More specifically, all the achievable…
The capacity under strong asynchronism was recently shown to be essentially unaffected by the imposed output sampling rate $\rho$ and decoding delay $d$---the elapsed time between when information is available at the transmitter and when it…
Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,\epsilon)$ of length-$n$ codes subject to an average decoding error…