English
Related papers

Related papers: State-Dependent DMC with a Causal Helper

200 papers

The capacity of a state-dependent discrete memoryless channel (SD-DMC) is derived for the setting where a message-cognizant rate-limited helper observes the state sequence noncausally, produces its description, and provides the description…

Information Theory · Computer Science 2023-11-15 Amos Lapidoth , Ligong Wang , Yiming Yan

The problem of state communication over a discrete memoryless channel with discrete memoryless state is studied when the state information is available strictly causally at the encoder. It is shown that block Markov encoding, in which the…

Information Theory · Computer Science 2015-03-20 Chiranjib Choudhuri , Young-Han Kim , Urbashi Mitra

The capacity of a memoryless state-dependent channel is derived for a setting in which the encoder is provided with rate-limited assistance from a cribbing helper that observes the state sequence causally and the past channel inputs…

Information Theory · Computer Science 2024-01-24 Amos Lapidoth , Yossef Steinberg

We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DMC) with i.i.d. states. The encoder takes probing actions…

Information Theory · Computer Science 2016-11-15 Himanshu Asnani , Haim Permuter , Tsachy Weissman

In this paper, we consider a discrete memoryless point to point channel with noisy feedback, where there is a sender with a private message that she wants to communicate to a receiver by sequentially transmitting symbols over a noisy…

Systems and Control · Electrical Eng. & Systems 2020-02-25 Deepanshu Vasal

For a state-dependent DMC with input alphabet $\mathcal{X}$ and state alphabet $\mathcal{S}$ where the i.i.d. state sequence is known causally at the transmitter, it is shown that by using at most…

Information Theory · Computer Science 2007-07-13 Hamidreza Farmanbar , Amir K. Khandani

We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the epsilon-capacity as well as necessary and sufficient conditions for the…

Information Theory · Computer Science 2014-07-16 Marco Tomamichel , Vincent Y. F. Tan

We propose a new inner bound on the capacity region of a memoryless multiple-access channel that is governed by a memoryless state that is known strictly causally to the encoders. The new inner bound contains the previous bounds, and we…

Information Theory · Computer Science 2011-06-03 Amos Lapidoth , Yossef Steinberg

We generalize the problem of controlling the interference created to an external observer while communicating over a discrete memoryless channel (DMC) which was studied in \cite{serrano:2014}. In particular, we consider the scenario where…

Information Theory · Computer Science 2021-06-04 Michail Mylonakis , Photios A. Stavrou , Mikael Skoglund

The problem of communication and state estimation is considered in the context of channels with actiondependent states. Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the…

Information Theory · Computer Science 2012-02-07 Chiranjib Choudhuri , Urbashi Mitra

A memoryless state-dependent broadcast channel (BC) is considered, where the transmitter wishes to convey two private messages to two receivers while simultaneously estimating the respective states via generalized feedback. The model at…

Information Theory · Computer Science 2020-11-09 Mehrasa Ahmadipour , Michèle Wigger , Mari Kobayashi

A memoryless state-dependent multiple access channel (MAC) is considered where two transmitters wish to convey a respective message to a receiver while simultaneously estimating the respective channel state via generalized feedback. The…

Information Theory · Computer Science 2019-02-12 Mari Kobayashi , Hassan Hamad , Gerhard Kramer , Giuseppe Caire

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states and the channel…

Information Theory · Computer Science 2023-05-03 Yiqi Chen , Tobias Oechtering , Mikael Skoglund , Yuan Luo

In this paper, we introduce a discrete memoryless State-Dependent Relay Channel with Private Messages (SD-RCPM) as a generalization of the state-dependent relay channel. We investigate two main cases: SD-RCPM with non-causal Channel State…

Information Theory · Computer Science 2016-11-17 Bahareh Akhbari , Mahtab Mirmohseni , Mohammad Reza Aref

State-dependent bipartite networks with state-cognizant receivers and state-informed transmitters are studied. Such networks have no nodes that both transmit and receive. Examples are the multi-access channel, the broadcast channel, and the…

Information Theory · Computer Science 2026-04-29 Amos Lapidoth , Baohua Ni , Ligong Wang

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-17 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

As a class of state-dependent channels, Markov channels have been long studied in information theory for characterizing the feedback capacity and error exponent. This paper studies a more general variant of such channels where the state…

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

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states and the channel…

Information Theory · Computer Science 2023-06-27 Yiqi Chen , Tobias Oechtering , Mikael Skoglund , Yuan Luo

A communication setup is considered where a transmitter wishes to simultaneously sense its channel state and convey a message to a receiver. The state is estimated at the transmitter by means of generalized feedback, i.e. a strictly causal…

Information Theory · Computer Science 2018-05-16 Mari Kobayashi , Giuseppe Caire , Gerhard Kramer

A lower bound on the secrecy capacity of the wiretap channel with state information available causally at both the encoder and decoder is established. The lower bound is shown to be strictly larger than that for the noncausal case by Liu…

Information Theory · Computer Science 2010-06-03 Yeow-Khiang Chia , Abbas El Gamal
‹ Prev 1 2 3 10 Next ›