On noncoherent correction of network errors and erasures with random locations
We consider the problem of correcting errors and erasures with network coding. Unlike existing works which consider performance limits for worst-case locations of given numbers of errors and erasures, we consider the performance of given (not necessarily optimal) coding and forwarding strategies for...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1000 |
|---|---|
| container_issue | |
| container_start_page | 996 |
| container_title | |
| container_volume | |
| creator | Vyetrenko, S. Ho, T. Erez, E. |
| description | We consider the problem of correcting errors and erasures with network coding. Unlike existing works which consider performance limits for worst-case locations of given numbers of errors and erasures, we consider the performance of given (not necessarily optimal) coding and forwarding strategies for given (not necessarily worst-case) models of error and erasure locations. Our approach characterizes decoding success in terms of the rank of certain matrices corresponding to useful and erroneous information received at the sink nodes. We use this approach to analyze random coding and forwarding strategies on a family of simple networks with random error and erasure locations, and show that the relative performance of the strategies depends on the erasure and error probabilities. |
| doi_str_mv | 10.1109/ISIT.2009.5205602 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5205602</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5205602</ieee_id><sourcerecordid>5205602</sourcerecordid><originalsourceid>FETCH-LOGICAL-i218t-a6d35966765132db2429e131fdcabf65e233f990e911ca32cc15236273c1aac83</originalsourceid><addsrcrecordid>eNpVkMtOwzAURM2jEqX0AxAb_0CC772xHS9RxSNSRReUdeU6jhpobWQHVfw9RZQFqxnN0cxiGLsGUQIIc9u8NMsShTClRCGVwBM2NbqGCquqIiBxysYIUhc1gD77x5DO_5gwcsTGGgvQpiJ9wS5zfhOCNAkcs-dF4CEGFzc--TBwF1Pybuhj4LHjwQ_7mN65TymmzG1oD9bmz-Qz3_fDhqdDFHd8G5396eQrNursNvvpUSfs9eF-OXsq5ovHZnY3L3qEeiisakkapbSSQNiusULjgaBrnV13Snok6owR3gA4S-gcSCSFmhxY62qasJvf3d57v_pI_c6mr9XxJvoG7LtVaQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On noncoherent correction of network errors and erasures with random locations</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Vyetrenko, S. ; Ho, T. ; Erez, E.</creator><creatorcontrib>Vyetrenko, S. ; Ho, T. ; Erez, E.</creatorcontrib><description>We consider the problem of correcting errors and erasures with network coding. Unlike existing works which consider performance limits for worst-case locations of given numbers of errors and erasures, we consider the performance of given (not necessarily optimal) coding and forwarding strategies for given (not necessarily worst-case) models of error and erasure locations. Our approach characterizes decoding success in terms of the rank of certain matrices corresponding to useful and erroneous information received at the sink nodes. We use this approach to analyze random coding and forwarding strategies on a family of simple networks with random error and erasure locations, and show that the relative performance of the strategies depends on the erasure and error probabilities.</description><identifier>ISSN: 2157-8095</identifier><identifier>ISBN: 9781424443123</identifier><identifier>ISBN: 1424443121</identifier><identifier>EISSN: 2157-8117</identifier><identifier>EISBN: 9781424443130</identifier><identifier>EISBN: 142444313X</identifier><identifier>DOI: 10.1109/ISIT.2009.5205602</identifier><identifier>LCCN: 72-179437</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer errors ; Decoding ; Error correction ; Error correction codes ; Error probability ; Network coding ; Network topology ; Performance analysis ; Resilience ; Routing</subject><ispartof>2009 IEEE International Symposium on Information Theory, 2009, p.996-1000</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5205602$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5205602$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Vyetrenko, S.</creatorcontrib><creatorcontrib>Ho, T.</creatorcontrib><creatorcontrib>Erez, E.</creatorcontrib><title>On noncoherent correction of network errors and erasures with random locations</title><title>2009 IEEE International Symposium on Information Theory</title><addtitle>ISIT</addtitle><description>We consider the problem of correcting errors and erasures with network coding. Unlike existing works which consider performance limits for worst-case locations of given numbers of errors and erasures, we consider the performance of given (not necessarily optimal) coding and forwarding strategies for given (not necessarily worst-case) models of error and erasure locations. Our approach characterizes decoding success in terms of the rank of certain matrices corresponding to useful and erroneous information received at the sink nodes. We use this approach to analyze random coding and forwarding strategies on a family of simple networks with random error and erasure locations, and show that the relative performance of the strategies depends on the erasure and error probabilities.</description><subject>Computer errors</subject><subject>Decoding</subject><subject>Error correction</subject><subject>Error correction codes</subject><subject>Error probability</subject><subject>Network coding</subject><subject>Network topology</subject><subject>Performance analysis</subject><subject>Resilience</subject><subject>Routing</subject><issn>2157-8095</issn><issn>2157-8117</issn><isbn>9781424443123</isbn><isbn>1424443121</isbn><isbn>9781424443130</isbn><isbn>142444313X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkMtOwzAURM2jEqX0AxAb_0CC772xHS9RxSNSRReUdeU6jhpobWQHVfw9RZQFqxnN0cxiGLsGUQIIc9u8NMsShTClRCGVwBM2NbqGCquqIiBxysYIUhc1gD77x5DO_5gwcsTGGgvQpiJ9wS5zfhOCNAkcs-dF4CEGFzc--TBwF1Pybuhj4LHjwQ_7mN65TymmzG1oD9bmz-Qz3_fDhqdDFHd8G5396eQrNursNvvpUSfs9eF-OXsq5ovHZnY3L3qEeiisakkapbSSQNiusULjgaBrnV13Snok6owR3gA4S-gcSCSFmhxY62qasJvf3d57v_pI_c6mr9XxJvoG7LtVaQ</recordid><startdate>20090101</startdate><enddate>20090101</enddate><creator>Vyetrenko, S.</creator><creator>Ho, T.</creator><creator>Erez, E.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>20090101</creationdate><title>On noncoherent correction of network errors and erasures with random locations</title><author>Vyetrenko, S. ; Ho, T. ; Erez, E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i218t-a6d35966765132db2429e131fdcabf65e233f990e911ca32cc15236273c1aac83</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Computer errors</topic><topic>Decoding</topic><topic>Error correction</topic><topic>Error correction codes</topic><topic>Error probability</topic><topic>Network coding</topic><topic>Network topology</topic><topic>Performance analysis</topic><topic>Resilience</topic><topic>Routing</topic><toplevel>online_resources</toplevel><creatorcontrib>Vyetrenko, S.</creatorcontrib><creatorcontrib>Ho, T.</creatorcontrib><creatorcontrib>Erez, E.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Vyetrenko, S.</au><au>Ho, T.</au><au>Erez, E.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On noncoherent correction of network errors and erasures with random locations</atitle><btitle>2009 IEEE International Symposium on Information Theory</btitle><stitle>ISIT</stitle><date>2009-01-01</date><risdate>2009</risdate><spage>996</spage><epage>1000</epage><pages>996-1000</pages><issn>2157-8095</issn><eissn>2157-8117</eissn><isbn>9781424443123</isbn><isbn>1424443121</isbn><eisbn>9781424443130</eisbn><eisbn>142444313X</eisbn><abstract>We consider the problem of correcting errors and erasures with network coding. Unlike existing works which consider performance limits for worst-case locations of given numbers of errors and erasures, we consider the performance of given (not necessarily optimal) coding and forwarding strategies for given (not necessarily worst-case) models of error and erasure locations. Our approach characterizes decoding success in terms of the rank of certain matrices corresponding to useful and erroneous information received at the sink nodes. We use this approach to analyze random coding and forwarding strategies on a family of simple networks with random error and erasure locations, and show that the relative performance of the strategies depends on the erasure and error probabilities.</abstract><pub>IEEE</pub><doi>10.1109/ISIT.2009.5205602</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2157-8095 |
| ispartof | 2009 IEEE International Symposium on Information Theory, 2009, p.996-1000 |
| issn | 2157-8095 2157-8117 |
| language | eng |
| recordid | cdi_ieee_primary_5205602 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computer errors Decoding Error correction Error correction codes Error probability Network coding Network topology Performance analysis Resilience Routing |
| title | On noncoherent correction of network errors and erasures with random locations |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T16%3A55%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20noncoherent%20correction%20of%20network%20errors%20and%20erasures%20with%20random%20locations&rft.btitle=2009%20IEEE%20International%20Symposium%20on%20Information%20Theory&rft.au=Vyetrenko,%20S.&rft.date=2009-01-01&rft.spage=996&rft.epage=1000&rft.pages=996-1000&rft.issn=2157-8095&rft.eissn=2157-8117&rft.isbn=9781424443123&rft.isbn_list=1424443121&rft_id=info:doi/10.1109/ISIT.2009.5205602&rft_dat=%3Cieee_6IE%3E5205602%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424443130&rft.eisbn_list=142444313X&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5205602&rfr_iscdi=true |