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

Roni Con, Amir Shpilka

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In the binary deletion channel with parameter p (BDCp) every bit is deleted independently with probability p. [1] proved a lower bound of (1-p)/9 on the capacity of the BDCp, yet currently no explicit construction achieves this rate. In this work we give an explicit family of codes of rate (1 -p)/16, for every p. This improves upon the work of Guruswami and Li [2] that gave a construction of rate (1-p)/120. The codes in our family have polynomial time encoding and decoding algorithms.

Original languageEnglish
Title of host publication2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages84-89
Number of pages6
ISBN (Electronic)9781728164328
DOIs
StatePublished - Jun 2020
Event2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States
Duration: 21 Jul 202026 Jul 2020

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2020-June
ISSN (Print)2157-8095

Conference

Conference2020 IEEE International Symposium on Information Theory, ISIT 2020
Country/TerritoryUnited States
CityLos Angeles
Period21/07/2026/07/20

Fingerprint

Dive into the research topics of 'Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel'. Together they form a unique fingerprint.

Cite this