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

10/30/2021
by   Ittai Rubinstein, et al.
0

Two of the most common models for channels with synchronisation errors are the Binary Deletion Channel with parameter p (BDC_p) – a channel where every bit of the codeword is deleted i.i.d with probability p, and the Poisson Repeat Channel with parameter λ (PRC_λ) – a channel where every bit of the codeword is repeated Poisson(λ) times. Previous codes for these channels can be split into two main categories: inefficient constructions that prove the capacities of these channels are greater than 1-p/9, λ/9 respectively, and more recently, codes with efficient encoding and decoding algorithms that have lower rates 1-p/16, λ/17. In this work, we present a new method for concatenating synchronisation codes. This method can be used to transform lower bounds on the capacities of these channels into efficient constructions, at a negligible cost to the rate of the code. This yields a family of codes with quasi-linear encoding and decoding algorithms that achieve rates of 1-p/9, λ/9 respectively for these channels.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2019

Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel

This work gives an explicit construction of a family of error correcting...
research
01/30/2022

Efficient Near-Optimal Codes for General Repeat Channels

Given a probability distribution 𝒟 over the non-negative integers, a 𝒟-r...
research
09/18/2020

Higher Rates and Information-Theoretic Analysis for the RLWE Channel

The Learning with Errors (LWE) problem is an 𝒩𝒫-hard problem that lies t...
research
08/31/2020

Coding Constructions for Efficient Oblivious Transfer from Noisy Channels

We consider oblivious transfer protocols performed over binary symmetric...
research
06/13/2023

Competitive Channel-Capacity

We consider communication over channels whose statistics are not known i...
research
04/09/2018

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

We investigate the problem of reliable communication between two legitim...
research
02/20/2021

Symbol-Level Synchronisation Channel Modelling With Real-World Application: From Davey-Mackay, Fritchman to Markov

Errors in realistic channels contain not only substitution errors, but s...

Please sign up or login with your details

Forgot password? Click here to reset