English
Related papers

Related papers: The Duality Upper Bound for Finite-State Channels …

200 papers

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…

Information Theory · Computer Science 2015-12-18 Jihad Fahs , Ibrahim Abou-Faycal

We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$. Our bound is obtained by considering a multicast transmission…

Information Theory · Computer Science 2021-03-29 Anelia Somekh-Baruch

We derive exact upper and lower bounds for the cumulative distribution function (cdf) of the output of a neural network (NN) over its entire support subject to noisy (stochastic) inputs. The upper and lower bounds converge to the true cdf…

Machine Learning · Computer Science 2025-06-11 Andrey Kofnov , Daniel Kapla , Ezio Bartocci , Efstathia Bura

This paper studies a memoryless state-dependent multiple access channel (MAC) where two transmitters wish to convey a message to a receiver under the assumption of causal and imperfect channel state information at transmitters (CSIT) and…

Information Theory · Computer Science 2021-06-18 Lorenzo Miretti , Mari Kobayashi , David Gesbert , Paul de Kerret

Fundamental limits of the cognitive interference channel (CIC) with two pairs of transmitter-receiver has been under exploration for several years. In this paper, we study the discrete memoryless cognitive interference channel (DM-CIC) in…

Information Theory · Computer Science 2012-10-09 Mojtaba Vaezi

We consider the problem of communicating the state of a dynamical system via a Shannon Gaussian channel. The receiver, which acts as both a decoder and estimator, observes the noisy measurement of the channel output and makes an optimal…

Information Theory · Computer Science 2015-06-02 Ather Gattami

The use of channel output feedback to improve the reliability of fading channels has received scant attention in the literature. In most work on feedback for fading channels, only channel state information (CSI) feedback has been exploited…

Information Theory · Computer Science 2012-04-12 Mayur Agrawal , David J. Love , Venkataramanan Balakrishnan

We develop an exhaustive study of Markov decision process (MDP) under mean field interaction both on states and actions in the presence of common noise, and when optimization is performed over open-loop controls on infinite horizon. Such…

Optimization and Control · Mathematics 2021-09-10 Médéric Motte , Huyên Pham

Martingale concentration inequalities constitute a powerful mathematical tool in the analysis of problems in a wide variety of fields ranging from probability and statistics to information theory and machine learning. Here we apply…

Quantum Physics · Physics 2017-03-07 Cambyse Rouze , Nilanjana Datta

We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

This paper formulates adaptive controller design as a minimax dual control problem. The objective is to design a controller that minimizes the worst-case performance over a set of uncertain systems. The uncertainty is described by a set of…

Optimization and Control · Mathematics 2024-09-09 Olle Kjellqvist , Anders Rantzer

Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions…

Information Theory · Computer Science 2016-11-17 Andrew Thangaraj

We study the online estimation of the optimal policy of a Markov decision process (MDP). We propose a class of Stochastic Primal-Dual (SPD) methods which exploit the inherent minimax duality of Bellman equations. The SPD methods update a…

Machine Learning · Statistics 2016-12-09 Yichen Chen , Mengdi Wang

Markov decision processes (MDP) are finite-state systems with both strategic and probabilistic choices. After fixing a strategy, an MDP produces a sequence of probability distributions over states. The sequence is eventually synchronizing…

Computer Science and Game Theory · Computer Science 2013-11-01 Laurent Doyen , Thierry Massart , Mahsa Shirmohammadi

Molecular communication (MC) enables information transfer via molecules, making it ideal for biomedical applications where traditional methods fall short. In many such scenarios, identifying specific events is more critical than decoding…

Information Theory · Computer Science 2025-04-30 Yaning Zhao , Pau Colomer , Holger Boche , Christian Deppe

Optimal queueing control of multi-hop networks remains a challenging problem even in the simplest scenarios. In this paper, we consider a two-hop half-duplex relaying system with random channel connectivity. The relay is equipped with a…

Information Theory · Computer Science 2015-10-28 Bo Zhou , Ying Cui , Meixia Tao

We study channel simulation under common randomness assistance in the finite-blocklength regime and identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.…

Information Theory · Computer Science 2024-10-10 Michael X. Cao , Navneeth Ramakrishnan , Mario Berta , Marco Tomamichel

In this paper, first, we investigate the model of degraded broadcast channel with side information and confidential messages. This work is from Steinberg's work on the degraded broadcast channel with causal and noncausal side information,…

Information Theory · Computer Science 2016-11-17 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

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…

Information Theory · Computer Science 2011-08-02 Ahmad Abu Al Haija , Mai Vu

The achievable information rate of finite-state input two-dimensional (2-D) channels with memory is an open problem, which is relevant, e.g., for inter-symbol-interference (ISI) channels and cellular multiple-access channels. We propose a…

Information Theory · Computer Science 2007-07-13 Ori Shental , Noam Shental , Shlomo Shamai