A Tamper-Free Semi-Universal Communication System for Deletion Channels

04/09/2018
by   Shahab Asoodeh, et al.
0

We investigate the problem of reliable communication between two legitimate parties over deletion channels under an active eavesdropping (aka jamming) adversarial model. To this goal, we develop a theoretical framework based on probabilistic finite-state automata to define novel encoding and decoding schemes that ensure small error probability in both message decoding as well as tamper detecting. We then experimentally verify the reliability and tamper-detection property of our scheme.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2019

On the Capacity of Channels with Deletions and States

We consider the class of channels formed from the concatenation of a del...
research
01/28/2019

Efficient Multiparty Interactive Coding for Insertions, Deletions and Substitutions

In the field of interactive coding, two or more parties wish to carry ou...
research
04/15/2020

Decoding algorithms of monotone codes and azinv codes and their unified view

This paper investigates linear-time decoding algorithms for two classes ...
research
05/24/2022

Delayed Coding Scheme for Channels with Insertion, Deletion, and Substitution Errors

We propose a new coding scheme, called the delayed coding (DC) scheme, f...
research
10/30/2021

Explicit and Efficient Construction of (nearly) Optimal Rate Codes for Binary Deletion Channel and the Poisson Repeat Channel

Two of the most common models for channels with synchronisation errors a...
research
05/17/2023

Stronger Polarization for the Deletion Channel

In this paper we show a polar coding scheme for the deletion channel wit...
research
03/28/2023

Optimal Spatial Deconvolution and Message Reconstruction from a Large Generative Model of Models

We introduce a general-purpose univariate signal deconvolution method ba...

Please sign up or login with your details

Forgot password? Click here to reset