On The Decoding Error Weight of One or Two Deletion Channels
This paper tackles two problems that are relevant to coding for insertions and deletions. These problems are motivated by several applications, among them is reconstructing strands in DNA-based storage systems. Under this paradigm, a word is transmitted over some fixed number of identical independen...
Saved in:
Published in | arXiv.org |
---|---|
Main Authors | , , , , |
Format | Paper |
Language | English |
Published |
Ithaca
Cornell University Library, arXiv.org
07.01.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | This paper tackles two problems that are relevant to coding for insertions and deletions. These problems are motivated by several applications, among them is reconstructing strands in DNA-based storage systems. Under this paradigm, a word is transmitted over some fixed number of identical independent channels and the goal of the decoder is to output the transmitted word or some close approximation of it. The first part of this paper studies the deletion channel that deletes a symbol with some fixed probability \(p\), while focusing on two instances of this channel. Since operating the maximum likelihood (ML) decoder in this case is computationally unfeasible, we study a slightly degraded version of this decoder for two channels and its expected normalized distance. We identify the dominant error patterns and based on these observations, it is derived that the expected normalized distance of the degraded ML decoder is roughly \(\frac{3q-1}{q-1}p^2\), when the transmitted word is any \(q\)-ary sequence and \(p\) is the channel's deletion probability. We also study the cases when the transmitted word belongs to the Varshamov Tenengolts (VT) code or the shifted VT code. Additionally, the insertion channel is studied as well as the case of two insertion channels. These theoretical results are verified by corresponding simulations. The second part of the paper studies optimal decoding for a special case of the deletion channel, the \(k\)-deletion channel, which deletes exactly \(k\) symbols of the transmitted word uniformly at random. In this part, the goal is to understand how an optimal decoder operates in order to minimize the expected normalized distance. A full characterization of an efficient optimal decoder for this setup, referred to as the maximum likelihood* (ML*) decoder, is given for a channel that deletes one or two symbols. |
---|---|
AbstractList | This paper tackles two problems that are relevant to coding for insertions and deletions. These problems are motivated by several applications, among them is reconstructing strands in DNA-based storage systems. Under this paradigm, a word is transmitted over some fixed number of identical independent channels and the goal of the decoder is to output the transmitted word or some close approximation of it. The first part of this paper studies the deletion channel that deletes a symbol with some fixed probability \(p\), while focusing on two instances of this channel. Since operating the maximum likelihood (ML) decoder in this case is computationally unfeasible, we study a slightly degraded version of this decoder for two channels and its expected normalized distance. We identify the dominant error patterns and based on these observations, it is derived that the expected normalized distance of the degraded ML decoder is roughly \(\frac{3q-1}{q-1}p^2\), when the transmitted word is any \(q\)-ary sequence and \(p\) is the channel's deletion probability. We also study the cases when the transmitted word belongs to the Varshamov Tenengolts (VT) code or the shifted VT code. Additionally, the insertion channel is studied as well as the case of two insertion channels. These theoretical results are verified by corresponding simulations. The second part of the paper studies optimal decoding for a special case of the deletion channel, the \(k\)-deletion channel, which deletes exactly \(k\) symbols of the transmitted word uniformly at random. In this part, the goal is to understand how an optimal decoder operates in order to minimize the expected normalized distance. A full characterization of an efficient optimal decoder for this setup, referred to as the maximum likelihood* (ML*) decoder, is given for a channel that deletes one or two symbols. |
Author | Sabary, Omer Yaakobi, Eitan Bar-Lev, Daniella Gershon, Yotam Yucovich, Alexander |
Author_xml | – sequence: 1 givenname: Omer surname: Sabary fullname: Sabary, Omer – sequence: 2 givenname: Daniella surname: Bar-Lev fullname: Bar-Lev, Daniella – sequence: 3 givenname: Yotam surname: Gershon fullname: Gershon, Yotam – sequence: 4 givenname: Alexander surname: Yucovich fullname: Yucovich, Alexander – sequence: 5 givenname: Eitan surname: Yaakobi fullname: Yaakobi, Eitan |
BookMark | eNqNirsKwkAQAA9RMGr-YcE6cO7lVdjFiF2agGUIunkRdvUuwd83hR9gNTAzO7VmYVopD405BWmIuFW-c4PWGuMEo8h46lwwlB3BhR7y7LmF3FqxcKe-7SaQBgomWET5keUZaeqFIetqZhrdQW2aenTk_7hXx2teZrfgZeU9k5uqQWbLS6owPqUmxVAn5r_rC8t6N_A |
ContentType | Paper |
Copyright | 2022. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
Copyright_xml | – notice: 2022. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PIMPY PQEST PQQKQ PQUKI PRINS PTHSS |
DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database Publicly Available Content Database ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest One Academic Engineering Collection |
DatabaseTitleList | Publicly Available Content Database |
Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Physics |
EISSN | 2331-8422 |
Genre | Working Paper/Pre-Print |
GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PIMPY PQEST PQQKQ PQUKI PRINS PTHSS |
ID | FETCH-proquest_journals_26183824073 |
IEDL.DBID | 8FG |
IngestDate | Tue Sep 24 22:34:14 EDT 2024 |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-proquest_journals_26183824073 |
OpenAccessLink | https://www.proquest.com/docview/2618382407/abstract/?pq-origsite=%requestingapplication% |
PQID | 2618382407 |
PQPubID | 2050157 |
ParticipantIDs | proquest_journals_2618382407 |
PublicationCentury | 2000 |
PublicationDate | 20220107 |
PublicationDateYYYYMMDD | 2022-01-07 |
PublicationDate_xml | – month: 01 year: 2022 text: 20220107 day: 07 |
PublicationDecade | 2020 |
PublicationPlace | Ithaca |
PublicationPlace_xml | – name: Ithaca |
PublicationTitle | arXiv.org |
PublicationYear | 2022 |
Publisher | Cornell University Library, arXiv.org |
Publisher_xml | – name: Cornell University Library, arXiv.org |
SSID | ssj0002672553 |
Score | 3.3653855 |
SecondaryResourceType | preprint |
Snippet | This paper tackles two problems that are relevant to coding for insertions and deletions. These problems are motivated by several applications, among them is... |
SourceID | proquest |
SourceType | Aggregation Database |
SubjectTerms | Channels Decoding Deletion Insertion Maximum likelihood decoding Storage systems Symbols |
Title | On The Decoding Error Weight of One or Two Deletion Channels |
URI | https://www.proquest.com/docview/2618382407/abstract/ |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1JS8NAFH7UBsGbKy61DOg1hEySSQKCoCYGwbZIxd7KZGZyTNo04s3f7ntDowehx1mYYba3fPMWgFsRoRiujaCYoaEbchm4KU8qt0pkKXwpVCmtgexEFO_hyyJaDKDofWHIrLKniZZQ60YRRu6hpJ8ECekfniwJBVCdd79au5Q_iv5Zt8k09sDxKSYe-Yznz79oCxcxys7BP4JruUh-CM5Mrkx7BANTH8O-Nb5UmxO4m9YMj4s9oSpIrIRlbdu07MOilqyp2LQ2DCvmXw32oWjZTc3ILaBGxnYKN3k2fyzcfsrl9npsln-LCc5giHq-OQemhUhjrSJRqRSfFS81Ck-pCqXgsYl9fQGjXSNd7m6-ggNOlvuEHsQjGHbtp7lGftqVY7tVY3AessnsDUuv39kPZ3p-0w |
link.rule.ids | 786,790,12792,21416,33408,33779,43635,43840 |
linkProvider | ProQuest |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LT8MwDLZgE2I3nuIxIBJcK7S0TVsJiQOsFBgbhyJ2q9IkPTajHeLvz446OCDtmkSJ8vJnf7FjgBsRohqujaA_QwMv4NL3Eh5XXhXLUoykUKV0DrJTkX0EL_Nw3hFubedWuZaJTlBrq4gjv0VNP_Zjsj_uF18eZY2i19UuhcY29AMfoZMixdOnX46Fiwg1Zv-fmHXYke5B_10uTLMPW6Y-gB3ncqnaQ7ib1Qw3iT2iAUgAwsZNYxv26bhKZis2qw3DgvzHYhv6I9vWjIIBaoSzI7hOx_lD5q2HLLpD0RZ_U_CPoYfWvTkBpoVIIq1CUakELxMvNapMiQqk4JGJRvoUhpt6OttcfQW7Wf42KSbP09dzGHDy3Sf-IBpCb9l8mwtE1GV56ZZtBVQuezY |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+The+Decoding+Error+Weight+of+One+or+Two+Deletion+Channels&rft.jtitle=arXiv.org&rft.au=Sabary%2C+Omer&rft.au=Bar-Lev%2C+Daniella&rft.au=Gershon%2C+Yotam&rft.au=Yucovich%2C+Alexander&rft.date=2022-01-07&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422 |