Related papers: To Feed or Not to Feed Back
This paper considers the problem of reliable communication over discrete-time channels whose impulse responses have length $L$ and exactly $S\leq L$ non-zero coefficients, and whose support and coefficients remain fixed over blocks of $N>L$…
The zero-error feedback capacity of the Gelfand-Pinsker channel is established. It can be positive even if the channel's zero-error capacity is zero in the absence of feedback. Moreover, the error-free transmission of a single bit may…
This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel without transmitter channel state information (CSI), which is connected to a limited capacity reliable link, known as the…
The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…
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,…
The sphere-packing bound $E_{sp}(R)$ bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless feedback is allowed from the decoder to the encoder. To…
Exact queueing analysis of erasure networks with network coding in a finite buffer regime is an extremely hard problem due to the large number of states in the network. In such networks, packets are lost due to either link erasures or due…
In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the…
The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…
This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random…
Conventionally, posterior matching is investigated in channel coding and block encoding contexts -- the source symbols are equiprobably distributed and are entirely known by the encoder before the transmission. In this paper, we consider a…
We consider a point-to-point communication system, where in addition to the encoder and the decoder, there is a helper that observes non-causally the realization of the noise vector and provides a (lossy) rate-$R_{\mbox{\tiny h}}$…
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…
The capacity of the semideterministic discrete memoryless broadcast channel (SD-BC) with partial message side-information (P-MSI) at the receivers is established. In the setting without a common message, it is shown that P-MSI to the…
We present an alternative take on the recently popularized concept of `\textit{joint sensing and communications}', which focuses on using communication resources also for sensing. Here, we propose the opposite, where we utilize the…
The performance of an error correcting code is evaluated by its error probability, rate, and en/decoding complexity. The performance of a series of codes is evaluated by, as the block lengths approach infinity, whether their error…
In this paper, we study a quantized feedback scheme to maximize the goodput of a finite blocklength communication scenario over a quasi-static fading channel. It is assumed that the receiver has perfect channel state information (CSI) and…
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…
We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon…
The capacity of accelerated channel is investigated for different classes of initial states. It is shown that, the capacities of the travelling channels depend on the frame in which the accelerated channels are observed in and the initial…