A Practical Coding Scheme for the BSC with Feedback

02/04/2021
by   Ke Wu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2021

Sequential Transmission Over Binary Asymmetric Channels With Feedback

In this paper, we consider the problem of variable-length coding over th...
research
04/14/2022

A Feedback Capacity-Achieving Coding Scheme for the (d,∞)-RLL Input-Constrained Binary Erasure Channel

This paper considers the memoryless input-constrained binary erasure cha...
research
08/25/2012

A Novel Data Hiding Scheme for Binary Images

This paper presents a new scheme for hiding a secret message in binary i...
research
08/04/2020

Simple Modulo can Significantly Outperform Deep Learning-based Deepcode

Deepcode (H.Kim et al.2018) is a recently suggested Deep Learning-based ...
research
12/14/2019

Approximations in Probabilistic Programs

We study the first-order probabilistic programming language introduced b...
research
02/23/2023

Irregular Repetition Slotted ALOHA Over the Binary Adder Channel

We propose an irregular repetition slotted ALOHA (IRSA) based random-acc...
research
12/07/2020

Causal Posterior Matching and its Applications

We consider the problem of communication over the binary symmetric chann...

Please sign up or login with your details

Forgot password? Click here to reset