Polar Coding for the Binary Erasure Channel with Deletions

Polar Coding for the Binary Erasure Channel with Deletions

We study the application of polar codes in deletion channels by analyzing the cascade of a binary erasure channel (BEC) and a deletion channel. We show how polar codes can be used effectively on a BEC with a single deletion, and propose a list decoding algorithm with a cyclic redundancy check for th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Thomas, Eldho K, Tan, Vincent Y. F, Vardy, Alexander, Motani, Mehul
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Information Theory
Mathematics - Information Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Thomas, Eldho K
Tan, Vincent Y. F
Vardy, Alexander
Motani, Mehul
description We study the application of polar codes in deletion channels by analyzing the cascade of a binary erasure channel (BEC) and a deletion channel. We show how polar codes can be used effectively on a BEC with a single deletion, and propose a list decoding algorithm with a cyclic redundancy check for this case. The decoding complexity is $O(N^2\log N)$, where $N$ is the blocklength of the code. An important contribution is an optimization of the amount of redundancy added to minimize the overall error probability. Our theoretical results are corroborated by numerical simulations which show that the list size can be reduced to one and the original message can be recovered with high probability as the length of the code grows.
doi_str_mv 10.48550/arxiv.1701.01938
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1701_01938</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1701_01938</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-bb7a3b97de5b7856582701eb448b0c7380514b85407ea6c909e9104399da4abf3</originalsourceid><addsrcrecordid>eNotj71OwzAURr10QIUHYMIvkHBd27HNBmlLkSq1Q_fourkhllIHOSnQt6c_TN92vnMYexSQK6s1PGP6Dd-5MCByEE7aO_ay7TtMvOzrED950yc-tsTfQsR04ouEwzERL1uMkTr-E8aWz6mjMfRxuGeTBruBHv53ynbLxa5cZevN-0f5us6wMDbz3qD0ztSkvbG60HZ2vievlPWwN9KCFspbrcAQFnsHjpwAJZ2rUaFv5JQ93bBX-eorhcPZrbpEVNcI-QenPUBw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Polar Coding for the Binary Erasure Channel with Deletions</title><source>arXiv.org</source><creator>Thomas, Eldho K ; Tan, Vincent Y. F ; Vardy, Alexander ; Motani, Mehul</creator><creatorcontrib>Thomas, Eldho K ; Tan, Vincent Y. F ; Vardy, Alexander ; Motani, Mehul</creatorcontrib><description>We study the application of polar codes in deletion channels by analyzing the cascade of a binary erasure channel (BEC) and a deletion channel. We show how polar codes can be used effectively on a BEC with a single deletion, and propose a list decoding algorithm with a cyclic redundancy check for this case. The decoding complexity is $O(N^2\log N)$, where $N$ is the blocklength of the code. An important contribution is an optimization of the amount of redundancy added to minimize the overall error probability. Our theoretical results are corroborated by numerical simulations which show that the list size can be reduced to one and the original message can be recovered with high probability as the length of the code grows.</description><identifier>DOI: 10.48550/arxiv.1701.01938</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2017-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1701.01938$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1701.01938$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Thomas, Eldho K</creatorcontrib><creatorcontrib>Tan, Vincent Y. F</creatorcontrib><creatorcontrib>Vardy, Alexander</creatorcontrib><creatorcontrib>Motani, Mehul</creatorcontrib><title>Polar Coding for the Binary Erasure Channel with Deletions</title><description>We study the application of polar codes in deletion channels by analyzing the cascade of a binary erasure channel (BEC) and a deletion channel. We show how polar codes can be used effectively on a BEC with a single deletion, and propose a list decoding algorithm with a cyclic redundancy check for this case. The decoding complexity is $O(N^2\log N)$, where $N$ is the blocklength of the code. An important contribution is an optimization of the amount of redundancy added to minimize the overall error probability. Our theoretical results are corroborated by numerical simulations which show that the list size can be reduced to one and the original message can be recovered with high probability as the length of the code grows.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71OwzAURr10QIUHYMIvkHBd27HNBmlLkSq1Q_fourkhllIHOSnQt6c_TN92vnMYexSQK6s1PGP6Dd-5MCByEE7aO_ay7TtMvOzrED950yc-tsTfQsR04ouEwzERL1uMkTr-E8aWz6mjMfRxuGeTBruBHv53ynbLxa5cZevN-0f5us6wMDbz3qD0ztSkvbG60HZ2vievlPWwN9KCFspbrcAQFnsHjpwAJZ2rUaFv5JQ93bBX-eorhcPZrbpEVNcI-QenPUBw</recordid><startdate>20170108</startdate><enddate>20170108</enddate><creator>Thomas, Eldho K</creator><creator>Tan, Vincent Y. F</creator><creator>Vardy, Alexander</creator><creator>Motani, Mehul</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20170108</creationdate><title>Polar Coding for the Binary Erasure Channel with Deletions</title><author>Thomas, Eldho K ; Tan, Vincent Y. F ; Vardy, Alexander ; Motani, Mehul</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-bb7a3b97de5b7856582701eb448b0c7380514b85407ea6c909e9104399da4abf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Thomas, Eldho K</creatorcontrib><creatorcontrib>Tan, Vincent Y. F</creatorcontrib><creatorcontrib>Vardy, Alexander</creatorcontrib><creatorcontrib>Motani, Mehul</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Thomas, Eldho K</au><au>Tan, Vincent Y. F</au><au>Vardy, Alexander</au><au>Motani, Mehul</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Polar Coding for the Binary Erasure Channel with Deletions</atitle><date>2017-01-08</date><risdate>2017</risdate><abstract>We study the application of polar codes in deletion channels by analyzing the cascade of a binary erasure channel (BEC) and a deletion channel. We show how polar codes can be used effectively on a BEC with a single deletion, and propose a list decoding algorithm with a cyclic redundancy check for this case. The decoding complexity is $O(N^2\log N)$, where $N$ is the blocklength of the code. An important contribution is an optimization of the amount of redundancy added to minimize the overall error probability. Our theoretical results are corroborated by numerical simulations which show that the list size can be reduced to one and the original message can be recovered with high probability as the length of the code grows.</abstract><doi>10.48550/arxiv.1701.01938</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1701.01938
ispartof
issn
language eng
recordid cdi_arxiv_primary_1701_01938
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Information Theory
title Polar Coding for the Binary Erasure Channel with Deletions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T04%3A50%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Polar%20Coding%20for%20the%20Binary%20Erasure%20Channel%20with%20Deletions&rft.au=Thomas,%20Eldho%20K&rft.date=2017-01-08&rft_id=info:doi/10.48550/arxiv.1701.01938&rft_dat=%3Carxiv_GOX%3E1701_01938%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true