English
Related papers

Related papers: Capacity Bounds for Vertically-Drifted First Arriv…

200 papers

Any physical channel of communication offers two potential reasons why its capacity (the number of bits it can transmit in a unit of time) might be unbounded: (1) Infinitely many choices of signal strength at any given instant of time, and…

Information Theory · Computer Science 2011-05-18 Sanjeev Khanna , Madhu Sudan

The classical writing on dirty paper capacity result establishes that full interference pre-cancellation can be attained in Gelfand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the idealized…

Information Theory · Computer Science 2014-05-12 Stefano Rini , Shlomo Shamai

The capacity-achieving input distribution of the discrete-time, additive white Gaussian noise (AWGN) channel with an amplitude constraint is discrete and seems difficult to characterize explicitly. A dual capacity expression is used to…

Information Theory · Computer Science 2015-11-30 Andrew Thangaraj , Gerhard Kramer , Georg Bocherer

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor

Arbitrarily varying channels offer a powerful framework for analyzing the robustness of quantum communication systems, especially for classical-quantum models, where the analysis displays strengths or weaknesses of specific signal…

Quantum Physics · Physics 2025-07-25 Janis Nötzel , Florian Seitz

We study the problem of computing the capacity of a discrete memoryless channel under uncertainty affecting the channel law matrix, and possibly with a constraint on the average cost of the input distribution. The problem has been…

Information Theory · Computer Science 2018-05-28 Krzysztof Postek , Aharon Ben-Tal

Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the…

Quantum Physics · Physics 2025-10-03 Adam Taylor , Michael Hanks , Hyukjoon Kwon , M. S. Kim

We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Keerthi S. K. Arumugam , Matthieu R. Bloch

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…

Information Theory · Computer Science 2016-11-15 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

There are now several works on the use of the additive inverse Gaussian noise (AIGN) model for the random transit time in molecular communication~(MC) channels. The randomness invariably causes inter-symbol interference (ISI) in MC, an…

Information Theory · Computer Science 2015-09-01 Siavash Ghavami , Raviraj Adve , Farshad Lahouti

The two-way capacities of quantum channels determine the ultimate entanglement and secret-key distribution rates achievable by two distant parties that are connected by a noisy transmission line, in absence of quantum repeaters. Since…

Quantum Physics · Physics 2025-01-27 Francesco Anna Mele , Ludovico Lami , Vittorio Giovannetti

The use of 1-bit analog-to-digital converters (ADCs) is seen as a promising approach to significantly reduce the power consumption and hardware cost of multiple-input multiple-output (MIMO) receivers. However, the nonlinear distortion due…

Information Theory · Computer Science 2022-10-12 Neil Irwin Bernardo , Jingge Zhu , Yonina C. Eldar , Jamie Evans

This work studies the capacity of multipath fading channels. A noncoherent channel model is considered, where neither the transmitter nor the receiver is cognizant of the realization of the path gains, but both are cognizant of their…

Information Theory · Computer Science 2009-01-06 Tobias Koch , Amos Lapidoth

We study the capacity of discrete memoryless many-to-one interference channels, i.e., K user interference channels where only one receiver faces interference. For a class of many-to-one interference channels, we identify a noisy…

Information Theory · Computer Science 2009-12-17 Viveck R. Cadambe , Syed A. Jafar

This paper develops a tractable analytical channel model for first-hitting-time molecular communication (MC) systems under time-varying drift. While existing studies of nonstationary transport rely primarily on numerical solutions of…

Information Theory · Computer Science 2026-03-30 Yen-Chi Lee

The interference channel with a cognitive relay consists of a classical interference channel with two sourcedestination pairs and with an additional cognitive relay that has a priori knowledge of the sources' messages and aids in the…

Information Theory · Computer Science 2015-03-19 Stefano Riniy , Daniela Tuninetti , Natasha Devroye , Andrea Goldsmith

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number…

Information Theory · Computer Science 2008-03-11 Satish Babu Korada , Nicolas Macris

Non-orthogonal communications play an important role in future communication architectures. In such scenarios, the received signal is corrupted by an interfering signal which is typically cyclostationary in continuous-time. If the period of…

Information Theory · Computer Science 2019-10-18 Nir Shlezinger , Emeka Abakasanga , Ron Dabora , Yonina C. Eldar

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

The capacity of a relay channel with inter-symbol interference (ISI) and additive colored Gaussian noise is examined under an input power constraint. Prior results are used to show that the capacity of this channel can be computed by…

Information Theory · Computer Science 2011-03-02 Chiranjib Choudhuri , Urbashi Mitra
‹ Prev 1 3 4 5 6 7 10 Next ›