English
Related papers

Related papers: An Achievability Bound for Variable-Length Stop-Fe…

200 papers

We initiate the study of zero-error communication via quantum channels when the receiver and sender have at their disposal a noiseless feedback channel of unlimited quantum capacity, generalizing Shannon's zero-error communication theory…

Quantum Physics · Physics 2016-08-18 Runyao Duan , Simone Severini , Andreas Winter

It is well known that the capacity region of an average transmit power constrained Gaussian Broadcast Channel (GBC) with independent noise realizations at the receivers is enlarged by the presence of causal noiseless feedback. Capacity…

Information Theory · Computer Science 2020-09-21 Aditya Narayan Ravi , Sibi Raj B. Pillai , Vinod Prabhakaran , Michèle Wigger

We provide a complete characterization of the achievable distortion region for the problem of sending a bivariate Gaussian source over bandwidth-matched Gaussian broadcast channels, where each receiver is interested in only one component of…

Information Theory · Computer Science 2010-06-04 Chao Tian , Suhas Diggavi , Shlomo Shamai

The design of codes for feedback-enabled communications has been a long-standing open problem. Recent research on non-linear, deep learning-based coding schemes have demonstrated significant improvements in communication reliability over…

Information Theory · Computer Science 2023-06-09 Junghoon Kim , Taejoon Kim , David Love , Christopher Brinton

We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specifically, the instantaneous feedback is a function of an action…

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

In this work, we consider a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver. The law of the channel is presumed to be known to the receiver. In addition, we assume the…

Information Theory · Computer Science 2011-03-03 Meik Dörpinghaus , Heinrich Meyr

In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability…

Information Theory · Computer Science 2013-02-28 Amir Ingber , Ram Zamir , Meir Feder

The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a…

Information Theory · Computer Science 2024-10-28 Anatoly Khina , Neri Merhav

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…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…

Information Theory · Computer Science 2016-11-17 Jun Chen , Venugopal V. Veeravalli

This paper investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading…

Information Theory · Computer Science 2010-10-01 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

Most practical communication links are bi-directional. In these models, since the source node also receives signals, its encoder has the option of computing its output based on the signals it received in the past. On the other hand, from a…

Information Theory · Computer Science 2009-11-24 Xiang He , Aylin Yener

The transmission of a Gaussian source over a block-fading multiple antenna channel in the presence of a feedback link is considered. The feedback link is assumed to be an error and delay free link of capacity 1 bit per channel use. Under…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Andrea Goldsmith , H. Vincent Poor

We consider a molecular channel, in which messages are encoded to the frequency of objects in a pool, and whose output during reading time is a noisy version of the input frequencies, as obtained by sampling with replacement from the pool.…

Information Theory · Computer Science 2025-04-28 Ran Tamir , Nir Weinberger

Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…

Information Theory · Computer Science 2020-02-04 Lóránt Farkas , Tamás Kói

The energy-optimal scheme is found for communicating one bit over a memoryless Gaussian channel with an ideal feedback channel. It is assumed that the channel is allowed to be used at most N times before decoding. The optimal…

Information Theory · Computer Science 2016-05-17 Bo Bernhardsson , Ather Gattami

This paper investigates the information-theoretic limits of energy-harvesting (EH) channels in the finite blocklength regime. The EH process is characterized by a sequence of i.i.d. random variables with finite variances. We use the…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan , Jing Yang

Variable-length feedback codes can provide advantages over fixed-length feedback or non-feedback codes. This letter focuses on uncoded variable-symbol-length feedback communication and analyzes the autocorrelation and spectrum of the…

Information Theory · Computer Science 2022-11-23 Chin-Wei Hsu , Hun-Seok Kim , Achilleas Anastasopoulos

We prove that the ensemble the nested coset codes built on finite fields achieves the capacity of arbitrary discrete memoryless point-to-point channels. Exploiting it's algebraic structure, we develop a coding technique for communication…

Information Theory · Computer Science 2022-03-02 Arun Padakandla , Sandeep Pradhan

This paper addresses the problem of coding a continuous random source correlated with another source which is only available at the decoder. The proposed approach is based on the extension of the channel coding concept of syndrome from the…

Information Theory · Computer Science 2007-10-11 Lorenzo Cappellari