Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions
We present novel bounds on the capacity of binary channels with independent and identically distributed insertions, deletions, and substitutions. The proposed bounds are obtained by exploiting an auxiliary system where the channel is the same as the one in the system of interest, but the receiver is...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on communications 2011-01, Vol.59 (1), p.2-6 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 6 |
|---|---|
| container_issue | 1 |
| container_start_page | 2 |
| container_title | IEEE transactions on communications |
| container_volume | 59 |
| creator | Fertonani, Dario Duman, Tolga M Erden, M Fatih |
| description | We present novel bounds on the capacity of binary channels with independent and identically distributed insertions, deletions, and substitutions. The proposed bounds are obtained by exploiting an auxiliary system where the channel is the same as the one in the system of interest, but the receiver is provided with (partial) genie-aided information on the insertion/deletion process. In particular, we show that, when this information is revealed, we obtain a memoryless channel whose capacity, evaluated by means of the Blahut-Arimoto algorithm, gives an upper bound on the capacity of interest. We also show that capacity lower bounds can be derived as well, by exploiting the same auxiliary system and resorting to suitable information-theoretical inequalities. In most scenarios, the proposed bounds improve the existing ones, and significantly narrow the region to which the actual capacity can belong. |
| doi_str_mv | 10.1109/TCOMM.2010.110310.090039 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_861540189</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5629489</ieee_id><sourcerecordid>2246773091</sourcerecordid><originalsourceid>FETCH-LOGICAL-c368t-ca9286c33181bfe78a721a7dd551f9947acabee73ca08104b423b60913127eef3</originalsourceid><addsrcrecordid>eNpdkEtLw0AQgBdRsFZ_gZdFEC9GZ3eTfRw1vgpKD-p52WwnNBI3NZsg_femTenB07y-GYaPEMrghjEwtx_5_O3thsNYiyGAARDmgExYlukEdKYOyQSGbiKV0sfkJMYvAEhBiAmZ3zd9WETaBNotkeZu5XzVrWlT0nzpQsA60t-qW9JZiNh2VRPiNX3AGrcpdWFB3_sidlXXbzun5Kh0dcSzXZySz6fHj_wleZ0_z_K718QLqbvEO8O19EIwzYoSlXaKM6cWiyxjpTGpct4ViEp4B5pBWqRcFBIME4wrxFJMydV4d9U2Pz3Gzn5X0WNdu4BNH62WLEuBaTOQF__Ir6Zvw_Cc1ak0XHK5gfQI-baJscXSrtrq27Vry8BuPNutZ7vxbEfPdvQ8rF7u7rvoXV22Lvgq7ve5UFIYpQfufOQqRNyPM8lNOnz5B685hj8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>846926269</pqid></control><display><type>article</type><title>Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions</title><source>IEEE Xplore</source><creator>Fertonani, Dario ; Duman, Tolga M ; Erden, M Fatih</creator><creatorcontrib>Fertonani, Dario ; Duman, Tolga M ; Erden, M Fatih</creatorcontrib><description>We present novel bounds on the capacity of binary channels with independent and identically distributed insertions, deletions, and substitutions. The proposed bounds are obtained by exploiting an auxiliary system where the channel is the same as the one in the system of interest, but the receiver is provided with (partial) genie-aided information on the insertion/deletion process. In particular, we show that, when this information is revealed, we obtain a memoryless channel whose capacity, evaluated by means of the Blahut-Arimoto algorithm, gives an upper bound on the capacity of interest. We also show that capacity lower bounds can be derived as well, by exploiting the same auxiliary system and resorting to suitable information-theoretical inequalities. In most scenarios, the proposed bounds improve the existing ones, and significantly narrow the region to which the actual capacity can belong.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2010.110310.090039</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; Applied sciences ; Benchmark testing ; Binary channels ; capacity bounds ; Capacity planning ; Channel capacity ; Channel models ; Channels ; Deletion ; Exact sciences and technology ; Inequalities ; Insertion ; insertion/deletion errors ; Lower bounds ; Memoryless systems ; Receivers ; Studies ; substitution errors ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Transmission and modulation (techniques and equipments) ; Upper bound ; Upper bounds</subject><ispartof>IEEE transactions on communications, 2011-01, Vol.59 (1), p.2-6</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c368t-ca9286c33181bfe78a721a7dd551f9947acabee73ca08104b423b60913127eef3</citedby><cites>FETCH-LOGICAL-c368t-ca9286c33181bfe78a721a7dd551f9947acabee73ca08104b423b60913127eef3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5629489$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,4024,27923,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5629489$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23763978$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Fertonani, Dario</creatorcontrib><creatorcontrib>Duman, Tolga M</creatorcontrib><creatorcontrib>Erden, M Fatih</creatorcontrib><title>Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>We present novel bounds on the capacity of binary channels with independent and identically distributed insertions, deletions, and substitutions. The proposed bounds are obtained by exploiting an auxiliary system where the channel is the same as the one in the system of interest, but the receiver is provided with (partial) genie-aided information on the insertion/deletion process. In particular, we show that, when this information is revealed, we obtain a memoryless channel whose capacity, evaluated by means of the Blahut-Arimoto algorithm, gives an upper bound on the capacity of interest. We also show that capacity lower bounds can be derived as well, by exploiting the same auxiliary system and resorting to suitable information-theoretical inequalities. In most scenarios, the proposed bounds improve the existing ones, and significantly narrow the region to which the actual capacity can belong.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Benchmark testing</subject><subject>Binary channels</subject><subject>capacity bounds</subject><subject>Capacity planning</subject><subject>Channel capacity</subject><subject>Channel models</subject><subject>Channels</subject><subject>Deletion</subject><subject>Exact sciences and technology</subject><subject>Inequalities</subject><subject>Insertion</subject><subject>insertion/deletion errors</subject><subject>Lower bounds</subject><subject>Memoryless systems</subject><subject>Receivers</subject><subject>Studies</subject><subject>substitution errors</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>Upper bound</subject><subject>Upper bounds</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkEtLw0AQgBdRsFZ_gZdFEC9GZ3eTfRw1vgpKD-p52WwnNBI3NZsg_femTenB07y-GYaPEMrghjEwtx_5_O3thsNYiyGAARDmgExYlukEdKYOyQSGbiKV0sfkJMYvAEhBiAmZ3zd9WETaBNotkeZu5XzVrWlT0nzpQsA60t-qW9JZiNh2VRPiNX3AGrcpdWFB3_sidlXXbzun5Kh0dcSzXZySz6fHj_wleZ0_z_K718QLqbvEO8O19EIwzYoSlXaKM6cWiyxjpTGpct4ViEp4B5pBWqRcFBIME4wrxFJMydV4d9U2Pz3Gzn5X0WNdu4BNH62WLEuBaTOQF__Ir6Zvw_Cc1ak0XHK5gfQI-baJscXSrtrq27Vry8BuPNutZ7vxbEfPdvQ8rF7u7rvoXV22Lvgq7ve5UFIYpQfufOQqRNyPM8lNOnz5B685hj8</recordid><startdate>201101</startdate><enddate>201101</enddate><creator>Fertonani, Dario</creator><creator>Duman, Tolga M</creator><creator>Erden, M Fatih</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>201101</creationdate><title>Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions</title><author>Fertonani, Dario ; Duman, Tolga M ; Erden, M Fatih</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c368t-ca9286c33181bfe78a721a7dd551f9947acabee73ca08104b423b60913127eef3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Benchmark testing</topic><topic>Binary channels</topic><topic>capacity bounds</topic><topic>Capacity planning</topic><topic>Channel capacity</topic><topic>Channel models</topic><topic>Channels</topic><topic>Deletion</topic><topic>Exact sciences and technology</topic><topic>Inequalities</topic><topic>Insertion</topic><topic>insertion/deletion errors</topic><topic>Lower bounds</topic><topic>Memoryless systems</topic><topic>Receivers</topic><topic>Studies</topic><topic>substitution errors</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>Upper bound</topic><topic>Upper bounds</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fertonani, Dario</creatorcontrib><creatorcontrib>Duman, Tolga M</creatorcontrib><creatorcontrib>Erden, M Fatih</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE Xplore</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fertonani, Dario</au><au>Duman, Tolga M</au><au>Erden, M Fatih</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2011-01</date><risdate>2011</risdate><volume>59</volume><issue>1</issue><spage>2</spage><epage>6</epage><pages>2-6</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>We present novel bounds on the capacity of binary channels with independent and identically distributed insertions, deletions, and substitutions. The proposed bounds are obtained by exploiting an auxiliary system where the channel is the same as the one in the system of interest, but the receiver is provided with (partial) genie-aided information on the insertion/deletion process. In particular, we show that, when this information is revealed, we obtain a memoryless channel whose capacity, evaluated by means of the Blahut-Arimoto algorithm, gives an upper bound on the capacity of interest. We also show that capacity lower bounds can be derived as well, by exploiting the same auxiliary system and resorting to suitable information-theoretical inequalities. In most scenarios, the proposed bounds improve the existing ones, and significantly narrow the region to which the actual capacity can belong.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TCOMM.2010.110310.090039</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0090-6778 |
| ispartof | IEEE transactions on communications, 2011-01, Vol.59 (1), p.2-6 |
| issn | 0090-6778 1558-0857 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_861540189 |
| source | IEEE Xplore |
| subjects | Algorithms Applied sciences Benchmark testing Binary channels capacity bounds Capacity planning Channel capacity Channel models Channels Deletion Exact sciences and technology Inequalities Insertion insertion/deletion errors Lower bounds Memoryless systems Receivers Studies substitution errors Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Upper bound Upper bounds |
| title | Bounds on the Capacity of Channels with Insertions, Deletions and Substitutions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T06%3A09%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Bounds%20on%20the%20Capacity%20of%20Channels%20with%20Insertions,%20Deletions%20and%20Substitutions&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Fertonani,%20Dario&rft.date=2011-01&rft.volume=59&rft.issue=1&rft.spage=2&rft.epage=6&rft.pages=2-6&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2010.110310.090039&rft_dat=%3Cproquest_RIE%3E2246773091%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=846926269&rft_id=info:pmid/&rft_ieee_id=5629489&rfr_iscdi=true |