English
Related papers

Related papers: Feedback Communication Over the BSC with Sparse Fe…

200 papers

For information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback…

Information Theory · Computer Science 2010-11-10 M. V. Burnashev , H. Yamamoto

Traditional channel coding with feedback constructs and transmits a codeword only after all message bits are available at the transmitter. This paper joins Guo & Kostina and Lalitha et. al. in developing approaches for causal (or…

Information Theory · Computer Science 2021-04-30 Amaael Antonini , Rita Gimeshein , Richard D. Wesel

In this paper we introduce a fundamental principle for optimal communication over general memoryless channels in the presence of noiseless feedback, termed posterior matching. Using this principle, we devise a (simple, sequential) generic…

Information Theory · Computer Science 2010-08-11 Ofer Shayevitz , Meir Feder

For the information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that…

Information Theory · Computer Science 2008-08-18 Marat V. Burnashev , Hirosuke Yamamoto

The posterior matching scheme, for feedback encoding of a message point lying on the unit interval over memoryless channels, maximizes mutual information for an arbitrary number of channel uses. However, it in general does not always…

Information Theory · Computer Science 2019-01-10 Diego A. Mesa , Rui Ma , Siva K. Gorantla , Todd P. Coleman

In multi-terminal networks, feedback increases the capacity region and helps communication devices to coordinate. In this article, we deepen the relationship between coordination and feedback by considering a point-to-point scenario with an…

Information Theory · Computer Science 2016-11-15 Maël Le Treust

Building on the work of Horstein, Shayevitz and Feder, and Naghshvar \emph{et al.}, this paper presents algorithms for low-complexity sequential transmission of a $k$-bit message over the binary symmetric channel (BSC) with full, noiseless…

Information Theory · Computer Science 2020-05-19 Amaael Antonini , Hengjie Yang , Richard D. Wesel

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

A discrete time stochastic feedback control system with a noisy communication channel between the sensor and the controller is considered. The sensor has limited memory. At each time, the sensor transmits encoded symbol over the channel and…

Optimization and Control · Mathematics 2007-05-23 Aditya Mahajan , Demosthenis Teneketzis

Samples from a high-dimensional AR[1] process are observed by a sender which can communicate only finitely many bits per unit time to a receiver. The receiver seeks to form an estimate of the process value at every time instant in…

Information Theory · Computer Science 2022-02-01 Rooji Jinan , Parimal Parag , Himanshu Tyagi

We consider the problem of communication over the binary symmetric channel with feedback, where the information sequence is made available in a causal, possibly random, fashion. We develop a real-time variant of the renowned Horstein scheme…

Information Theory · Computer Science 2020-12-08 Anusha Lalitha , Anatoly Khina , Tara Javidi

In this paper, a general binary-input binary-output (BIBO) channel is investigated in the presence of feedback and input constraints. The feedback capacity and the optimal input distribution of this setting are calculated for the case of an…

Information Theory · Computer Science 2018-01-09 Oron Sabag , Haim H. Permuter , Navin Kashyap

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

We propose two coding schemes for the two-receiver discrete memoryless broadcast channel (BC) with rate-limited feedback from one or both receivers. They improve over the nofeedback capacity region for a large class of channels, including…

Information Theory · Computer Science 2016-02-19 Youlong Wu , Michèle Wigger

In this paper we propose a feedback scheme for transmitting secret messages between two legitimate parties, over an eavesdropped communication link. Relative to Wyner's traditional encoding scheme \cite{wyner1}, our feedback-based encoding…

Information Theory · Computer Science 2009-09-29 George Amariucai , Shuangqing Wei

In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an adversary is proportional to the number of transmissions,…

Information Theory · Computer Science 2021-02-11 Christian Deppe , Vladimir Lebedev , Georg Maringer , Nikita Polyanskii

We investigate the maximum coding rate achievable over a two-user broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback codes. Specifically, upon decoding the common message, each…

Information Theory · Computer Science 2015-04-23 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also feedback channel with independent additive Gaussian noise, and the transmitter observes without delay all outputs of the…

Information Theory · Computer Science 2012-08-15 M. V. Burnashev , H. Yamamoto

Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk--Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are…

Information Theory · Computer Science 2016-09-08 Cheuk Ting Li , Abbas El Gamal

In this paper, a new problem of transmitting information over the adversarial insertion-deletion channel with feedback is introduced. Suppose that the encoder transmits $n$ binary symbols one-by-one over a channel, in which some symbols can…

Information Theory · Computer Science 2022-01-12 Georg Maringer , Nikita Polyanskii , Ilya Vorobyev , Lorenz Welter
‹ Prev 1 2 3 10 Next ›