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

Roni Con; Amir Shpilka

doi:https://doi.org/10.1109/ISIT44484.2020.9173977

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

Roni Con, Amir Shpilka

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In the binary deletion channel with parameter p (BDC_p) every bit is deleted independently with probability p. [1] proved a lower bound of (1-p)/9 on the capacity of the BDC_p, 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 language	English
Title of host publication	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	84-89
Number of pages	6
ISBN (Electronic)	9781728164328
DOIs	https://doi.org/10.1109/ISIT44484.2020.9173977
State	Published - Jun 2020
Event	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States Duration: 21 Jul 2020 → 26 Jul 2020

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2020-June

Conference

Conference	2020 IEEE International Symposium on Information Theory, ISIT 2020
Country/Territory	United States
City	Los Angeles
Period	21/07/20 → 26/07/20

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

https://doi.org/10.1109/ISIT44484.2020.9173977

Cite this

Con, R., & Shpilka, A. (2020). Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings (pp. 84-89). Article 9173977 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT44484.2020.9173977

@inproceedings{eab627d56f634bcab53531da8446a53c,

title = "Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel",

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.",

author = "Roni Con and Amir Shpilka",

note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 2020 IEEE International Symposium on Information Theory, ISIT 2020 ; Conference date: 21-07-2020 Through 26-07-2020",

year = "2020",

month = jun,

doi = "https://doi.org/10.1109/ISIT44484.2020.9173977",

language = "الإنجليزيّة",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "84--89",

booktitle = "2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings",

address = "الولايات المتّحدة",

}

Con, R & Shpilka, A 2020, Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel. in 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings., 9173977, IEEE International Symposium on Information Theory - Proceedings, vol. 2020-June, Institute of Electrical and Electronics Engineers Inc., pp. 84-89, 2020 IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, United States, 21/07/20. https://doi.org/10.1109/ISIT44484.2020.9173977

Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel. / Con, Roni; Shpilka, Amir.
2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2020. p. 84-89 9173977 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Con, Roni

AU - Shpilka, Amir

PY - 2020/6

Y1 - 2020/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85090402284&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/ISIT44484.2020.9173977

DO - https://doi.org/10.1109/ISIT44484.2020.9173977

M3 - منشور من مؤتمر

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 84

EP - 89

BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020

Y2 - 21 July 2020 through 26 July 2020

ER -

Con R, Shpilka A. Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2020. p. 84-89. 9173977. (IEEE International Symposium on Information Theory - Proceedings). doi: https://doi.org/10.1109/ISIT44484.2020.9173977

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

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this