We provide a practical implementation of the rubber method of Ahlswede et al. for binary alphabets. The idea is to create the "skeleton" sequence therein via an arithmetic decoder designed for a particular k-th order Markov chain. For the stochastic binary symmetric channel, we show that the scheme is nearly optimal in a strong sense for certain parameters.
Cite
@article{arxiv.2102.02358,
title = {A Practical Coding Scheme for the BSC with Feedback},
author = {Ke Wu and Aaron B. Wagner},
journal= {arXiv preprint arXiv:2102.02358},
year = {2021}
}
Comments
Submitted to IEEE Intl. Symp. on Inf. Theory (ISIT)