{"id":"https://openalex.org/W2073060063","doi":"https://doi.org/10.1109/itw.2011.6089359","title":"An achievable region for the double unicast problem based on a minimum cut analysis","display_name":"An achievable region for the double unicast problem based on a minimum cut analysis","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2073060063","doi":"https://doi.org/10.1109/itw.2011.6089359","mag":"2073060063"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2011.6089359","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2011.6089359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Information Theory Workshop","raw_type":"proceedings-article"},"type":"article","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/A5029794321","display_name":"Shurui Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shurui Huang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aditya Ramamoorthy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5599,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.898463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"120","last_page":"124"},"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.9998000264167786,"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.9998000264167786,"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.953499972820282,"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/unicast","display_name":"Unicast","score":0.5242305397987366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.519013524055481},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38512101769447327},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.344845175743103},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32783621549606323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2833133339881897},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07955548167228699}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.5242305397987366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.519013524055481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38512101769447327},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.344845175743103},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32783621549606323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2833133339881897},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07955548167228699},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2011.6089359","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2011.6089359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Information Theory Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1592232663","https://openalex.org/W1965124840","https://openalex.org/W1976329386","https://openalex.org/W1977545325","https://openalex.org/W1984595105","https://openalex.org/W1984804011","https://openalex.org/W2023242304","https://openalex.org/W2048235391","https://openalex.org/W2053606434","https://openalex.org/W2063112325","https://openalex.org/W2073060063","https://openalex.org/W2074909003","https://openalex.org/W2105831729","https://openalex.org/W2115488441","https://openalex.org/W2120892086","https://openalex.org/W2121205191","https://openalex.org/W2133739890","https://openalex.org/W2138928022","https://openalex.org/W2159572035","https://openalex.org/W2164280516","https://openalex.org/W2164694181","https://openalex.org/W2167513698","https://openalex.org/W2295428206","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2508558984","https://openalex.org/W3008817519","https://openalex.org/W4288633135","https://openalex.org/W2952300997","https://openalex.org/W2794998165","https://openalex.org/W2910872135","https://openalex.org/W2378130666","https://openalex.org/W2615656263"],"abstract_inverted_index":{"We":[0,72],"consider":[1,67],"the":[2,42,83,171,177,182,185,202,216,227,230,235],"multiple":[3,43],"unicast":[4,44],"problem":[5,149],"under":[6],"network":[7],"coding":[8],"over":[9],"directed":[10],"acyclic":[11],"networks":[12],"when":[13],"there":[14],"are":[15,167],"two":[16],"source-terminal":[17],"pairs,":[18],"s":[19,29,103,205],"<sub":[20,25,30,35,87,92,98,104,110,115,120,128,133,192,206],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[21,26,31,36,88,93,99,105,111,116,121,129,134,193,207],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[22,27,117],"-":[23,33],"t":[24,34,119,191],"and":[28,108,131],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[32,37,106,122],".":[38,136],"Current":[39],"characterizations":[40],"of":[41,54,215,229],"capacity":[45],"region":[46,146,163,178,221],"in":[47,234],"this":[48,64,148,155,174],"setting":[49],"have":[50],"a":[51,68,161,212],"large":[52],"number":[53],"inequalities,":[55],"which":[56],"makes":[57],"them":[58],"hard":[59],"to":[60,169,198],"explicitly":[61],"evaluate.":[62],"In":[63],"work":[65],"we":[66,75,141,157,175],"slightly":[69],"different":[70,125,223,231],"problem.":[71],"assume":[73],"that":[74,189],"only":[76,196],"know":[77],"certain":[78],"minimum":[79],"cut":[80,232],"values":[81,233],"for":[82,124,147],"network,":[84],"e.g.,":[85],"mincut(S":[86],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</sub>":[89,100,130,194,208],",":[90,118,209],"T":[91,109,132],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">j</sub>":[94,112,135],"),":[95],"where":[96,164],"S":[97,127],"\u2286":[101,113],"{si,":[102],"}":[107,123],"{t":[114],"subsets":[126],"Based":[137],"on":[138,151],"these":[139],"values,":[140],"propose":[142],"an":[143],"achievable":[144],"rate":[145,220],"based":[150],"linear":[152,213],"codes.":[153],"Towards":[154],"end,":[156],"begin":[158],"by":[159,179],"defining":[160],"base":[162],"both":[165,170],"sources":[166],"multicast":[168],"terminals.":[172],"Following":[173],"enlarge":[176],"appropriately":[180],"encoding":[181],"information":[183,200],"at":[184],"source":[186,204],"nodes,":[187],"such":[188],"terminal":[190],"is":[195],"guaranteed":[197],"decode":[199],"from":[201],"intended":[203],"while":[210],"decoding":[211],"function":[214],"other":[217],"source.":[218],"The":[219],"takes":[222],"forms":[224],"depending":[225],"upon":[226],"relationship":[228],"network.":[236]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}