Related papers: Linear Sum Capacity for Gaussian Multiple Access C…
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…
The capacity of multiple-input multiple-output additive white Gaussian noise channels is investigated under peak amplitude constraints on the norm of the input vector. New insights on the capacity-achieving input distribution are presented.…
We consider the N-user broadcast erasure channel with public feedback and side information. Before the beginning of transmission, each receiver knows a function of the messages of some of the other receivers. This situation arises naturally…
We consider the special case of index coding over the Gaussian broadcast channel where each receiver has prior knowledge of a subset of messages at the transmitter and demands all the messages from the source. We propose a concatenated…
Most communication systems use some form of feedback, often related to channel state information. The common models used in analyses either assume perfect channel state information at the receiver and/or noiseless state feedback links.…
The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We characterize both an inner and an outer bound for this…
An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…
This paper investigates the asymptotic expansion for the size of block codes defined for the additive white Gaussian noise (AWGN) channel with feedback under the following setting: A peak power constraint is imposed on every transmitted…
We survey coding techniques that enable reliable transmission at rates that approach the capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view of modern coding theory and discuss how recent advances…
The capacity of a class of Interference Relay Channels (IRC) -the Injective Semideterministic IRC where the relay can only observe one of the sources- is investigated. We first derive a novel outer bound and two inner bounds which are based…
This paper derives a novel sum-rate outer bound for the general memoryless interference channel with three users. The derivation is a generalization of the techniques developed by Kramer and by Etkin et al for the Gaussian two-user channel.…
In this paper, we propose capacity-achieving communication schemes for Gaussian finite-state Markov channels (FSMCs) subject to an average channel input power constraint, under the assumption that the transmitters can have access to delayed…
The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…
Gaussian loss channels are of particular importance since they model realistic optical communication channels. Except for special cases, quantum capacity of Gaussian loss channels is not yet known completely. In this paper, we provide…
In this paper we derive closed-form formulas of feedback capacity and nonfeedback achievable rates, for Additive Gaussian Noise (AGN) channels driven by nonstationary autoregressive moving average (ARMA) noise (with unstable one poles and…
We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error probability.…
This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…
We analyze scheduling algorithms for multiuser communication systems with users having multiple antennas and linear receivers. When there is no feedback of channel information, we consider a common round robin scheduling algorithm, and…
Driven by the demands of high-frequency wireless communications in 5G and 6G systems (e.g., mmWave, sub-THz), we explore a state-dependent {\em Gaussian beam-pointing} (GBP) channel. In this model, the channel state defines an unknown angle…
A methodology is developed to realized optimal channel input conditional distributions, which maximize the finite-time horizon directed information, for channels with memory and feedback, by information lossless randomized strategies. The…