{"id":"https://openalex.org/W3198228592","doi":"https://doi.org/10.1109/isit45174.2021.9517734","title":"Exponentially Simpler Network Rate Regions","display_name":"Exponentially Simpler Network Rate Regions","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3198228592","doi":"https://doi.org/10.1109/isit45174.2021.9517734","mag":"3198228592"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9517734","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517734","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","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/A5040872851","display_name":"Yirui Liu","orcid":"https://orcid.org/0009-0002-5794-9682"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yirui Liu","raw_affiliation_strings":["Drexel University,Department of Electrical and Computer Engineering,Philadelphia,PA,USA,19104","Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"Drexel University,Department of Electrical and Computer Engineering,Philadelphia,PA,USA,19104","institution_ids":["https://openalex.org/I72816309"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060945955","display_name":"John MacLaren Walsh","orcid":null},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John MacLaren Walsh","raw_affiliation_strings":["Drexel University,Department of Electrical and Computer Engineering,Philadelphia,PA,USA,19104","Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"Drexel University,Department of Electrical and Computer Engineering,Philadelphia,PA,USA,19104","institution_ids":["https://openalex.org/I72816309"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040872851"],"corresponding_institution_ids":["https://openalex.org/I72816309"],"apc_list":null,"apc_paid":null,"fwci":0.3182,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61361834,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2548","last_page":"2553"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9975000023841858,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9950000047683716,"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/polyhedron","display_name":"Polyhedron","score":0.8147703409194946},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.7623742818832397},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5545946359634399},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5089805126190186},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.473806768655777},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.46391454339027405},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45698288083076477},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4274086356163025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38810789585113525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3736329674720764},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.34829458594322205},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3398158550262451},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19888493418693542},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10044169425964355},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08173608779907227}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8147703409194946},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.7623742818832397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5545946359634399},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5089805126190186},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.473806768655777},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.46391454339027405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45698288083076477},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4274086356163025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38810789585113525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3736329674720764},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.34829458594322205},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3398158550262451},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19888493418693542},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10044169425964355},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08173608779907227},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"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/isit45174.2021.9517734","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517734","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","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":28,"referenced_works":["https://openalex.org/W1847903816","https://openalex.org/W1976579642","https://openalex.org/W1979294498","https://openalex.org/W2037413426","https://openalex.org/W2059865055","https://openalex.org/W2060472508","https://openalex.org/W2095127695","https://openalex.org/W2096414292","https://openalex.org/W2105185344","https://openalex.org/W2138744797","https://openalex.org/W2139186281","https://openalex.org/W2150840006","https://openalex.org/W2216809397","https://openalex.org/W2262362834","https://openalex.org/W2502673344","https://openalex.org/W2547052808","https://openalex.org/W2949925098","https://openalex.org/W2951824038","https://openalex.org/W2962901739","https://openalex.org/W2963283980","https://openalex.org/W2964195131","https://openalex.org/W2976539725","https://openalex.org/W3106164725","https://openalex.org/W3198761672","https://openalex.org/W4300840296","https://openalex.org/W6638734688","https://openalex.org/W6724810792","https://openalex.org/W6801061037"],"related_works":["https://openalex.org/W2916043681","https://openalex.org/W2896131632","https://openalex.org/W2391438543","https://openalex.org/W2008231869","https://openalex.org/W2522231841","https://openalex.org/W1972258194","https://openalex.org/W2997473813","https://openalex.org/W4250631474","https://openalex.org/W323119424","https://openalex.org/W2327310844"],"abstract_inverted_index":{"Determining":[0],"the":[1,12,31,47,55,59,84,87,100,115,120,131,134,138,142,147],"rate":[2,53,88,101,125,144],"region":[3,89,102,126,145],"of":[4,8,15,19,45,52,58,79,86,103,113,149],"a":[5,66,94,104,109,124],"network":[6,16,105],"is":[7,106,127,158],"great":[9],"importance":[10],"in":[11,91],"research":[13],"area":[14],"coding.":[17],"Lots":[18],"attempts":[20],"have":[21],"been":[22,28],"made":[23],"and":[24,64,108,157],"significant":[25],"progress":[26],"has":[27,137,153],"achieved":[29],"over":[30],"last":[32],"decade":[33],"on":[34],"this":[35,92],"topic.":[36],"Although":[37],"these":[38],"researches":[39],"provide":[40],"us":[41],"with":[42,77,130],"multiple":[43],"ways":[44],"calculating":[46],"outer":[48,121],"or":[49],"inner":[50],"bounds":[51,122],"region,":[54],"sheer":[56],"complexity":[57,85],"problem,":[60],"which":[61],"involves":[62],"expressing":[63],"projecting":[65],"very":[67],"high":[68],"dimensional":[69],"polyhedra,":[70],"makes":[71],"it":[72],"computationally":[73],"infeasible":[74],"beyond":[75],"networks":[76],"10s":[78],"edges.":[80],"Aimed":[81],"at":[82],"reducing":[83],"calculation,":[90],"paper":[93],"new":[95],"theorem":[96,116],"that":[97,152],"implicitly":[98],"determines":[99],"proved":[107],"corresponding":[110],"systematic":[111],"way":[112],"applying":[114],"to":[117,123,140],"calculate":[118,141],"explicitly":[119],"proposed.":[128],"Compared":[129],"traditional":[132],"method,":[133],"proposed":[135],"method":[136],"potential":[139],"true":[143],"via":[146],"projection":[148],"simpler":[150],"polyhedra":[151],"exponentially":[154,161],"less":[155,162],"dimensions":[156],"characterized":[159],"by":[160],"facets.":[163]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}