English
Related papers

Related papers: Data-Driven Estimation of Capacity Upper Bounds

200 papers

The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are…

Information Theory · Computer Science 2012-07-13 Jean-Michel Passerieux , Francois-Xavier Socheleau , Christophe Laot

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…

Information Theory · Computer Science 2016-12-28 Pierre Moulin

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

The autoencoder concept has fostered the reinterpretation and the design of modern communication systems. It consists of an encoder, a channel, and a decoder block which modify their internal neural structure in an end-to-end learning…

Information Theory · Computer Science 2020-09-14 Nunzio A. Letizia , Andrea M. Tonello

We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the…

Information Theory · Computer Science 2018-07-02 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

Degraded K-user broadcast channels (BC) are studied when receivers are facilitated with cache memories. Lower and upper bounds are derived on the capacity-memory tradeoff, i.e., on the largest rate of reliable communication over the BC as a…

Information Theory · Computer Science 2017-02-28 Shirin Saeedi Bidokhti , Michele Wigger , Aylin Yener

A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state…

Information Theory · Computer Science 2025-06-19 Yao Liu , Min Li , An Liu , Lawrence Ong , Aylin Yener

Channels with synchronization errors, such as deletion and insertion errors, are crucial in DNA storage, data reconstruction, and other applications. These errors introduce memory to the channel, complicating its capacity analysis. This…

Information Theory · Computer Science 2025-05-13 Busra Tegin , Tolga M Duman

While capacities of discrete memoryless channels are well studied, it is still not possible to obtain a closed-form expression for the capacity of an arbitrary discrete memoryless channel. This paper describes an elementary technique based…

Information Theory · Computer Science 2020-01-08 Thuan Nguyen , Thinh Nguyen

We calculate the quantum capacity of an amplitude-damping channel with time correlated Markov noise, for two channel uses. Our results show that memory of the channel increases it's ability to transmit quantum information significantly. We…

Quantum Physics · Physics 2017-07-03 Rabia Jahangir , Nigum Arshed , A. H. Toor

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…

Information Theory · Computer Science 2026-04-14 Amin Gohari , Gerhard Kramer

We address the problem of universal communications over an unknown channel with an instantaneous noiseless feedback, and show how rates corresponding to the empirical behavior of the channel can be attained, although no rate can be…

Information Theory · Computer Science 2008-09-01 Ofer Shayevitz , Meir Feder

Outer bounds on the admissible source region for broadcast channels with dependent sources are developed and used to prove capacity results for several classes of sources and channels.

Information Theory · Computer Science 2009-02-16 Gerhard Kramer , Yingbin Liang , Shlomo Shamai

The problem of bistatic integrated sensing and communications over memoryless relay channels is considered, where destination concurrently decodes the message sent by the source and estimates unknown parameters from received signals with…

Information Theory · Computer Science 2026-03-05 Yao Liu , Min Li , Lawrence Ong , Aylin Yener

Multiple-input multiple-output (MIMO) systems require efficient and accurate channel estimation with low pilot overhead to unlock their full potential for high spectral and energy efficiency. While deep generative models have emerged as a…

Signal Processing · Electrical Eng. & Systems 2026-01-21 Yongqiang Zhang , Qurrat-Ul-Ain Nadeem

The channel capacity of a nonlinear, dispersive fiber-optic link is revisited. To this end, the popular Gaussian noise (GN) model is extended with a parameter to account for the finite memory of realistic fiber channels. This finite-memory…

Information Theory · Computer Science 2015-01-07 Erik Agrell , Alex Alvarado , Giuseppe Durisi , Magnus Karlsson

In this paper nonhomogeneous deterministic and stochastic Maxwell equations are used to rigorously formulate the capacity of electromagnetic channels such as wave guides (cavities, coaxial cables etc). Both distributed, but localized, and…

Information Theory · Computer Science 2008-10-22 N. U. Ahmed , F. Rezaei , S. Loyka

Directed information (DI) is a fundamental measure for the study and analysis of sequential stochastic models. In particular, when optimized over input distributions it characterizes the capacity of general communication channels. However,…

Information Theory · Computer Science 2023-01-03 Dor Tsur , Ziv Aharoni , Ziv Goldfeld , Haim Permuter

A class of cognitive interference channel with state is investigated, in which two transmitters (transmitters 1 and 2) communicate with two receivers (receivers 1 and 2) over an interference channel. The two transmitters jointly transmit a…

Information Theory · Computer Science 2012-07-10 Ruchen Duan Yingbin Liang

The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…

Information Theory · Computer Science 2017-07-13 Achilleas Anastasopoulos , Jui Wu