On Unique Decoding from Insertions and Deletions

On Unique Decoding from Insertions and Deletions

In this paper, we study how often unique decoding from $t$ insertions or $t$ deletions occurs for error correcting codes. Insertions and deletions frequently occur in synchronization problems and DNA, a medium which is beginning to be used for long term data storage. We define natural probabilistic...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Mazooji, Kayvon
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 Mazooji, Kayvon
description In this paper, we study how often unique decoding from $t$ insertions or $t$ deletions occurs for error correcting codes. Insertions and deletions frequently occur in synchronization problems and DNA, a medium which is beginning to be used for long term data storage. We define natural probabilistic channels that make $t$ insertions or $t$ deletions, and study the probability of unique decoding. Our most substantial contribution is the derivation of tight upper bounds on the probability of unique decoding for messages passed though these channels. We also consider other aspects of the problem, and derive improved upper bounds for linear codes and VT-codes.
doi_str_mv 10.48550/arxiv.1611.09073
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1611_09073</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1611_09073</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-14bca04ecdf5744b644d5e6b02c931fb2d495cea1b0cc949ac599ddd46f8e5613</originalsourceid><addsrcrecordid>eNotzsuKAjEUBNBsXIj6Aa7MD3SbmJu0WYqPURDc6LrJ40YCmta0ivP3M_bMqigKikPImLMS5lKyqcnv-Cq54rxkmlWiT9gh0VOK9yfSFbrGx3SmITdXukst5kdsUktN8r_jBbs2JL1gLi2O_nNAjpv1cbkt9oev3XKxL4yqRMHBOsMAnQ-yArAKwEtUls2cFjzYmQctHRpumXMatHFSa-89qDBHqbgYkMnfbUeubzleTf6uP_S6o4sfJp8-Pg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On Unique Decoding from Insertions and Deletions</title><source>arXiv.org</source><creator>Mazooji, Kayvon</creator><creatorcontrib>Mazooji, Kayvon</creatorcontrib><description>In this paper, we study how often unique decoding from $t$ insertions or $t$ deletions occurs for error correcting codes. Insertions and deletions frequently occur in synchronization problems and DNA, a medium which is beginning to be used for long term data storage. We define natural probabilistic channels that make $t$ insertions or $t$ deletions, and study the probability of unique decoding. Our most substantial contribution is the derivation of tight upper bounds on the probability of unique decoding for messages passed though these channels. We also consider other aspects of the problem, and derive improved upper bounds for linear codes and VT-codes.</description><identifier>DOI: 10.48550/arxiv.1611.09073</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2016-11</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/1611.09073$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1611.09073$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Mazooji, Kayvon</creatorcontrib><title>On Unique Decoding from Insertions and Deletions</title><description>In this paper, we study how often unique decoding from $t$ insertions or $t$ deletions occurs for error correcting codes. Insertions and deletions frequently occur in synchronization problems and DNA, a medium which is beginning to be used for long term data storage. We define natural probabilistic channels that make $t$ insertions or $t$ deletions, and study the probability of unique decoding. Our most substantial contribution is the derivation of tight upper bounds on the probability of unique decoding for messages passed though these channels. We also consider other aspects of the problem, and derive improved upper bounds for linear codes and VT-codes.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzsuKAjEUBNBsXIj6Aa7MD3SbmJu0WYqPURDc6LrJ40YCmta0ivP3M_bMqigKikPImLMS5lKyqcnv-Cq54rxkmlWiT9gh0VOK9yfSFbrGx3SmITdXukst5kdsUktN8r_jBbs2JL1gLi2O_nNAjpv1cbkt9oev3XKxL4yqRMHBOsMAnQ-yArAKwEtUls2cFjzYmQctHRpumXMatHFSa-89qDBHqbgYkMnfbUeubzleTf6uP_S6o4sfJp8-Pg</recordid><startdate>20161128</startdate><enddate>20161128</enddate><creator>Mazooji, Kayvon</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20161128</creationdate><title>On Unique Decoding from Insertions and Deletions</title><author>Mazooji, Kayvon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-14bca04ecdf5744b644d5e6b02c931fb2d495cea1b0cc949ac599ddd46f8e5613</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Mazooji, Kayvon</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>Mazooji, Kayvon</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Unique Decoding from Insertions and Deletions</atitle><date>2016-11-28</date><risdate>2016</risdate><abstract>In this paper, we study how often unique decoding from $t$ insertions or $t$ deletions occurs for error correcting codes. Insertions and deletions frequently occur in synchronization problems and DNA, a medium which is beginning to be used for long term data storage. We define natural probabilistic channels that make $t$ insertions or $t$ deletions, and study the probability of unique decoding. Our most substantial contribution is the derivation of tight upper bounds on the probability of unique decoding for messages passed though these channels. We also consider other aspects of the problem, and derive improved upper bounds for linear codes and VT-codes.</abstract><doi>10.48550/arxiv.1611.09073</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1611.09073
ispartof
issn
language eng
recordid cdi_arxiv_primary_1611_09073
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Information Theory
title On Unique Decoding from Insertions and 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-08T05%3A41%3A05IST&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=On%20Unique%20Decoding%20from%20Insertions%20and%20Deletions&rft.au=Mazooji,%20Kayvon&rft.date=2016-11-28&rft_id=info:doi/10.48550/arxiv.1611.09073&rft_dat=%3Carxiv_GOX%3E1611_09073%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