{"id":"https://openalex.org/W2550047216","doi":"https://doi.org/10.1109/allerton.2012.6483265","title":"Reliability guarantees for lossy network coding subgraph construction","display_name":"Reliability guarantees for lossy network coding subgraph construction","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2550047216","doi":"https://doi.org/10.1109/allerton.2012.6483265","mag":"2550047216"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2012.6483265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2012.6483265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089109536","display_name":"Thomas Stahlbuhk","orcid":"https://orcid.org/0000-0002-2128-5004"},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]},{"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":"Thomas Stahlbuhk","raw_affiliation_strings":["Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047576065","display_name":"Brooke Shrader","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]},{"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":"Brooke Shrader","raw_affiliation_strings":["Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.28513799,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"541","last_page":"548"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.762745201587677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6674879193305969},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6089581251144409},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5745817422866821},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5440792441368103},{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.51618891954422},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4697701632976532},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.46839189529418945},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.45642632246017456},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41843533515930176},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.41114920377731323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4002419710159302},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.34459635615348816},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2960135340690613},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.28870537877082825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2442997694015503},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14361140131950378}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.762745201587677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6674879193305969},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6089581251144409},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5745817422866821},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5440792441368103},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.51618891954422},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4697701632976532},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.46839189529418945},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.45642632246017456},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41843533515930176},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.41114920377731323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4002419710159302},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.34459635615348816},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2960135340690613},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28870537877082825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2442997694015503},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14361140131950378},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2012.6483265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2012.6483265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1485073799","https://openalex.org/W1970933841","https://openalex.org/W2016312880","https://openalex.org/W2030429378","https://openalex.org/W2035732731","https://openalex.org/W2045539756","https://openalex.org/W2048235391","https://openalex.org/W2059109315","https://openalex.org/W2069323107","https://openalex.org/W2099805730","https://openalex.org/W2143852630","https://openalex.org/W2171266829","https://openalex.org/W3124613635","https://openalex.org/W4213060235","https://openalex.org/W6995661459"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W3161514703","https://openalex.org/W3207627914","https://openalex.org/W2270959725","https://openalex.org/W2151525839","https://openalex.org/W648253840","https://openalex.org/W2051329268","https://openalex.org/W2092572272"],"abstract_inverted_index":{"Random":[0],"linear":[1,71],"network":[2,50,111],"coding":[3,112],"can":[4],"provide":[5,74],"robustness":[6],"to":[7,18,56,64,78,95,150],"link":[8],"losses,":[9],"and":[10,73,91,126,141,160],"in":[11,31,106,155],"this":[12,66],"work":[13],"we":[14],"present":[15,92],"an":[16,69,75,93],"approach":[17,146],"achieve":[19],"a":[20,48,115,148],"chosen":[21],"level":[22],"of":[23,41,99],"reliability.":[24],"We":[25,61,81],"formulate":[26],"the":[27,39,84,89,97,103,107,110,132,152,156],"subgraph":[28,113,144,161],"construction":[29,145],"problem,":[30],"which":[32],"participating":[33],"links":[34],"are":[35],"identified":[36],"along":[37],"with":[38,53],"number":[40],"coded":[42],"packets":[43],"contributed":[44],"by":[45,88,138],"each,":[46],"as":[47],"min-cost":[49],"flow":[51],"problem":[52,67],"probabilistic":[54],"constraints":[55],"represent":[57],"per-link":[58],"reliability":[59,86,134,159],"requirements.":[60],"show":[62],"how":[63],"transform":[65],"into":[68],"integer":[70],"program":[72],"approximate":[76],"algorithm":[77,94],"solve":[79],"it.":[80],"then":[82],"analyze":[83],"end-to-end":[85,133],"provided":[87],"scheme,":[90,140],"compute":[96],"probability":[98],"successful":[100],"decoding":[101],"at":[102],"destination":[104],"node,":[105],"case":[108],"that":[109,131,142],"is":[114,135],"Two":[116],"Terminal":[117],"Series":[118],"Parallel":[119],"(TTSP)":[120],"graph.":[121],"Results":[122],"from":[123],"numerical":[124],"examples":[125],"Monte":[127],"Carlo":[128],"simulation":[129],"indicate":[130],"accurately":[136],"computed":[137],"our":[139,143],"provides":[147],"means":[149],"select":[151],"operating":[153],"point":[154],"tradeoff":[157],"between":[158],"cost.":[162]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}