相关论文: Code spectrum and reliability function: Gaussian c…
This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by…
Recently, there have been considerable progresses on the bounds of various quantum channel capacities for bosonic Gaussian channels. Especially, several upper bounds for the classical capacity and the quantum capacity on the bosonic…
New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels are below certain…
A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this…
The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region is…
We consider the full-duplex two-way relay channel with direct link between two users and propose two coding schemes: a partial decode-forward scheme, and a combined decode-forward and compute-forward scheme. Both schemes use rate-splitting…
This paper investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading…
We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically…
An upper limit is given to the amount of quantum information that can be transmitted reliably down a noisy, decoherent quantum channel. A class of quantum error-correcting codes is presented that allow the information transmitted to attain…
The uplink of a Cloud Radio Access Network (CRAN) architecture is studied, where decoding at the cloud takes place at distributed decoding processors. To mitigate the impact of straggling decoders in the cloud, the cloud re-encodes the…
Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…
The compute-and-forward framework permits each receiver in a Gaussian network to directly decode a linear combination of the transmitted messages. The resulting linear combinations can then be employed as an end-to-end communication…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…
We derive lower and upper bounds on the identification capacity of inverse Gaussian channels, a fundamental model for molecular communications in fluid environments. The analysis considers deterministic encoding schemes under a peak time…
This paper investigates the asymptotic expansion for the maximum rate of fixed-length codes over a parallel Gaussian channel with feedback under the following setting: A peak power constraint is imposed on every transmitted codeword, and…
A coding scheme with scalar lattices is applied to K-receiver, Gaussian, vector broadcast channels with K independent messages, one for each receiver. The method decomposes each receiver channel into parallel scalar channels with known…
New lower and upper bounds on the reliability function of typewriter channels are given. Our lower bounds improve upon the (multiletter) expurgated bound of Gallager, furnishing a new and simple counterexample to a conjecture made in 1967…
A distributed inference scheme which uses bounded transmission functions over a Gaussian multiple access channel is considered. When the sensor measurements are decreasingly reliable as a function of the sensor index, the conditions on the…
This paper derives an improved sphere-packing (ISP) bound targeting codes of short to moderate block lengths. We first review the 1967 sphere-packing (SP67) bound for discrete memoryless channels, and a recent improvement by Valembois and…