Causal Posterior Matching and its Applications

by   Anusha Lalitha, et al.

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 and provide analytical guarantees for its error-probability exponential decay rate. We further use the scheme to stabilize an unstable control plant over a binary symmetric channel and compare the analytical guarantees with its empirical performance as well as with those of anytime-reliable codes.


page 1

page 2

page 3

page 4


Stochastic-Adversarial Channels : Online Adversaries With Feedback Snooping

The growing need for reliable communication over untrusted networks has ...

A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels

The interactive capacity of a channel is defined in this paper as the ma...

Efficiently Computable Converses for Finite-Blocklength Communication

This paper presents a method for computing a finite-blocklength converse...

On exact asymptotics of the error probability in channel coding: symmetric channels

The exact order of the optimal sub-exponentially decaying factor in the ...

A Practical Coding Scheme for the BSC with Feedback

We provide a practical implementation of the rubber method of Ahlswede e...

An Exploration of a New Group of Channel Symmetries

We study a certain symmetry group associated to any given communication ...

Rate of Prefix-free Codes in LQG Control Systems with Side Information

In this work, we study an LQG control system where one of two feedback c...