Related papers: State-Dependent Channels with a Message-Cognizant …
We consider a state-dependent parallel Gaussian channel with independent states and a common cognitive helper, in which two transmitters wish to send independent information to their corresponding receivers over two parallel subchannels.…
We establish the deterministic-code capacity region of a network with one transmitter and two receivers: an "ordinary receiver" and a "robust receiver." The channel to the ordinary receiver is a given (known) discrete memoryless channel…
We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…
A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. Source and relay are connected via two…
We consider a generalization of the discrete memoryless channel, in which the channel probability distribution is replaced by a uniform distribution over clouds of channel output sequences. For a random ensemble of such channels, we derive…
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…
We consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in…
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…
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…
The fundamental limits of communication over state-dependent discrete memoryless channels with noiseless feedback are studied, under the assumption that the communicating parties are allowed to use variable-length coding schemes. Various…
The capacity of a time-varying block-memoryless channel in which the transmitter and the receiver have access to (possibly different) noisy causal channel side information (CSI) is obtained. It is shown that the capacity formula obtained in…
A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. The source and the relay are connected via two…
The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter-receiver pairs, in which the cognitive transmitter has the…
We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…
We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We first define the physically degraded finite-state broadcast channel for which we…
In this study we consider rateless coding over discrete memoryless channels (DMC) with feedback. Unlike traditional fixed-rate codes, in rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level…
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…
We consider the capacity of memoryless finite-state multiple access channel (FS-MAC) with causal asymmetric noisy state information available at both transmitters and complete state information available at the receiver. Single letter inner…
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…
In practical communication systems, knowledge of channel models is often absent, and consequently, transceivers need be designed based on empirical data. In this work, we study data-driven approaches to reliably choosing decoding metrics…