{"id":"https://openalex.org/W2075233861","doi":"https://doi.org/10.1109/isit.2014.6874806","title":"Resilient flow decomposition of unicast connections with network coding","display_name":"Resilient flow decomposition of unicast connections with network coding","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2075233861","doi":"https://doi.org/10.1109/isit.2014.6874806","mag":"2075233861"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6874806","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874806","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1401.6670","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Peter Babarczi","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Peter Babarczi","raw_affiliation_strings":["MTA-BME Future Internet Research Group, Budapest University of Technology and Economics (BME)"],"affiliations":[{"raw_affiliation_string":"MTA-BME Future Internet Research Group, Budapest University of Technology and Economics (BME)","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Janos Tapolcai","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Janos Tapolcai","raw_affiliation_strings":["MTA-BME Future Internet Research Group, Budapest University of Technology and Economics (BME)"],"affiliations":[{"raw_affiliation_string":"MTA-BME Future Internet Research Group, Budapest University of Technology and Economics (BME)","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Lajos Ronyai","orcid":null},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]},{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Lajos Ronyai","raw_affiliation_strings":["Computer and Automation Research Institute, Hungarian Academy of Sciences and BME"],"affiliations":[{"raw_affiliation_string":"Computer and Automation Research Institute, Hungarian Academy of Sciences and BME","institution_ids":["https://openalex.org/I7597260","https://openalex.org/I4210117195"]}]},{"author_position":"last","author":{"id":null,"display_name":"Muriel Medard","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Muriel Medard","raw_affiliation_strings":["Research Lab. of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Research Lab. of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":null,"apc_paid":null,"fwci":2.518,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.90600818,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"116","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9599000215530396,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.7354000210762024},{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.7261999845504761},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.49709999561309814},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.3767000138759613},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3249000012874603},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.31310001015663147},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.30329999327659607},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.2985999882221222}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.7354000210762024},{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.7261999845504761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6880999803543091},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5042999982833862},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.49709999561309814},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4803999960422516},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3767000138759613},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3294000029563904},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.30329999327659607},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.2556999921798706},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.25540000200271606},{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2014.6874806","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874806","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1401.6670","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1401.6670","pdf_url":"https://arxiv.org/pdf/1401.6670","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.754.2481","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.754.2481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1401.6670.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1401.6670","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1401.6670","pdf_url":"https://arxiv.org/pdf/1401.6670","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1965512207","https://openalex.org/W2031823362","https://openalex.org/W2063112325","https://openalex.org/W2088254717","https://openalex.org/W2104618058","https://openalex.org/W2105831729","https://openalex.org/W2119564287","https://openalex.org/W2123562143","https://openalex.org/W2138928022","https://openalex.org/W4237496336","https://openalex.org/W6636342899"],"related_works":[],"abstract_inverted_index":{"In":[0,23],"this":[1,139],"paper":[2],"we":[3,25],"close":[4],"the":[5,35,40,52,77,88,100,104,130],"gap":[6],"between":[7,87],"end-to-end":[8,105],"diversity":[9,106],"coding":[10,14,28,107],"and":[11,37,60,65,83,90,103],"intra-session":[12],"network":[13,66],"for":[15],"unicast":[16],"connections":[17],"resilient":[18,95],"against":[19],"single":[20],"link":[21],"failures.":[22],"particular,":[24],"show":[26],"that":[27,75],"operations":[29],"are":[30],"sufficient":[31],"to":[32,136,144],"perform":[33],"at":[34,47],"source":[36,89],"receiver":[38],"if":[39],"user":[41],"data":[42],"can":[43,141],"be":[44,137],"split":[45],"into":[46],"most":[48],"two":[49],"parts":[50],"over":[51],"filed":[53],"GF(2).":[54],"Our":[55],"proof":[56],"is":[57,70],"purely":[58],"combinatorial":[59],"based":[61],"on":[62],"standard":[63],"graph":[64],"flow":[67,96],"techniques.":[68],"It":[69,115],"a":[71,117],"linear":[72],"time":[73],"construction":[74],"defines":[76],"route":[78],"of":[79,112],"subflows":[80],"A,":[81],"B":[82,86],"A":[84],"\u2295":[85],"destination":[91],"nodes.":[92],"The":[93],"proposed":[94],"decomposition":[97],"method":[98,123],"generalizes":[99],"1+1":[101],"protection":[102,122],"approaches":[108],"while":[109],"keeping":[110],"both":[111],"their":[113],"benefits.":[114],"provides":[116],"simple":[118],"yet":[119],"resource":[120],"efficient":[121],"feasible":[124],"in":[125],"2-connected":[126],"backbone":[127],"topologies.":[128],"Since":[129],"core":[131],"switches":[132],"do":[133],"not":[134],"need":[135],"modified,":[138],"result":[140],"bring":[142],"benefits":[143],"current":[145],"transport":[146],"networks.":[147]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}