Stronger Polarization for the Deletion Channel

Dar Arava; Ido Tal

doi:https://doi.org/10.1109/ISIT54713.2023.10206513

Stronger Polarization for the Deletion Channel

Dar Arava, Ido Tal

Technion - Israel Institute of Technology

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

Abstract

In this paper we show a polar coding scheme for the deletion channel with a probability of error that decays roughly like 2 - v ?, where ? is the length of the codeword. That is, the same decay rate as that of seminal polar codes for memoryless channels. This is stronger than prior art in which the square root is replaced by a cube root. Our coding scheme is similar yet distinct from prior art. The main differences are: 1) Guard-bands are placed in almost all polarization levels; 2) Trellis decoding is applied to the whole received word, and not to segments of it. As before, the scheme is capacity-achieving. The price we pay for this improvement is a higher decoding complexity, which is nonetheless still polynomial, O(?⁴).

Original language	English
Title of host publication	2023 IEEE International Symposium on Information Theory, ISIT 2023
Pages	1711-1716
Number of pages	6
ISBN (Electronic)	9781665475549
DOIs	https://doi.org/10.1109/ISIT54713.2023.10206513
State	Published - 2023
Event	2023 IEEE International Symposium on Information Theory, ISIT 2023 - Taipei, Taiwan, Province of China Duration: 25 Jun 2023 → 30 Jun 2023

Publication series

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

Conference

Conference	2023 IEEE International Symposium on Information Theory, ISIT 2023
Country/Territory	Taiwan, Province of China
City	Taipei
Period	25/06/23 → 30/06/23

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Applied Mathematics
Modelling and Simulation

Access to Document

https://doi.org/10.1109/ISIT54713.2023.10206513

Cite this

@inproceedings{8446af0ffd6544c6b6f027a30d11343a,

title = "Stronger Polarization for the Deletion Channel",

abstract = "In this paper we show a polar coding scheme for the deletion channel with a probability of error that decays roughly like 2 - v ?, where ? is the length of the codeword. That is, the same decay rate as that of seminal polar codes for memoryless channels. This is stronger than prior art in which the square root is replaced by a cube root. Our coding scheme is similar yet distinct from prior art. The main differences are: 1) Guard-bands are placed in almost all polarization levels; 2) Trellis decoding is applied to the whole received word, and not to segments of it. As before, the scheme is capacity-achieving. The price we pay for this improvement is a higher decoding complexity, which is nonetheless still polynomial, O(?4).",

author = "Dar Arava and Ido Tal",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 2023 IEEE International Symposium on Information Theory, ISIT 2023 ; Conference date: 25-06-2023 Through 30-06-2023",

year = "2023",

doi = "https://doi.org/10.1109/ISIT54713.2023.10206513",

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

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

pages = "1711--1716",

booktitle = "2023 IEEE International Symposium on Information Theory, ISIT 2023",

}

Arava, D & Tal, I 2023, Stronger Polarization for the Deletion Channel. in 2023 IEEE International Symposium on Information Theory, ISIT 2023. IEEE International Symposium on Information Theory - Proceedings, vol. 2023-June, pp. 1711-1716, 2023 IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, Province of China, 25/06/23. https://doi.org/10.1109/ISIT54713.2023.10206513

TY - GEN

T1 - Stronger Polarization for the Deletion Channel

AU - Arava, Dar

AU - Tal, Ido

PY - 2023

Y1 - 2023

N2 - In this paper we show a polar coding scheme for the deletion channel with a probability of error that decays roughly like 2 - v ?, where ? is the length of the codeword. That is, the same decay rate as that of seminal polar codes for memoryless channels. This is stronger than prior art in which the square root is replaced by a cube root. Our coding scheme is similar yet distinct from prior art. The main differences are: 1) Guard-bands are placed in almost all polarization levels; 2) Trellis decoding is applied to the whole received word, and not to segments of it. As before, the scheme is capacity-achieving. The price we pay for this improvement is a higher decoding complexity, which is nonetheless still polynomial, O(?4).

AB - In this paper we show a polar coding scheme for the deletion channel with a probability of error that decays roughly like 2 - v ?, where ? is the length of the codeword. That is, the same decay rate as that of seminal polar codes for memoryless channels. This is stronger than prior art in which the square root is replaced by a cube root. Our coding scheme is similar yet distinct from prior art. The main differences are: 1) Guard-bands are placed in almost all polarization levels; 2) Trellis decoding is applied to the whole received word, and not to segments of it. As before, the scheme is capacity-achieving. The price we pay for this improvement is a higher decoding complexity, which is nonetheless still polynomial, O(?4).

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

U2 - https://doi.org/10.1109/ISIT54713.2023.10206513

DO - https://doi.org/10.1109/ISIT54713.2023.10206513

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

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1711

EP - 1716

BT - 2023 IEEE International Symposium on Information Theory, ISIT 2023

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

Y2 - 25 June 2023 through 30 June 2023

ER -

Stronger Polarization for the Deletion Channel

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this