{"id":"https://openalex.org/W1772856558","doi":"https://doi.org/10.1109/tit.2016.2529643","title":"Cut-Set Bounds on Network Information Flow","display_name":"Cut-Set Bounds on Network Information Flow","publication_year":2016,"publication_date":"2016-02-12","ids":{"openalex":"https://openalex.org/W1772856558","doi":"https://doi.org/10.1109/tit.2016.2529643","mag":"1772856558"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2016.2529643","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2016.2529643","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1305.3706","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Satyajit Thakor","orcid":"https://orcid.org/0000-0001-9527-0975"},"institutions":[{"id":"https://openalex.org/I170239107","display_name":"University of South Australia","ror":"https://ror.org/01p93h210","country_code":"AU","type":"education","lineage":["https://openalex.org/I170239107"]},{"id":"https://openalex.org/I9579091","display_name":"Indian Institute of Technology Mandi","ror":"https://ror.org/05r9r2f34","country_code":"IN","type":"education","lineage":["https://openalex.org/I9579091"]}],"countries":["AU","IN"],"is_corresponding":false,"raw_author_name":"Satyajit Thakor","raw_affiliation_strings":["Institute for Telecommunications Research, University of South Australia, Adelaide, SA, Australia","School of Computing and Electrical Engineering, IIT Mandi, Mandi, India"],"raw_orcid":"https://orcid.org/0000-0001-9527-0975","affiliations":[{"raw_affiliation_string":"Institute for Telecommunications Research, University of South Australia, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I170239107"]},{"raw_affiliation_string":"School of Computing and Electrical Engineering, IIT Mandi, Mandi, India","institution_ids":["https://openalex.org/I9579091"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Alex Grant","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alex Grant","raw_affiliation_strings":["Myriota Pty Ltd., Adelaide, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Myriota Pty Ltd., Adelaide, SA, Australia","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Terence Chan","orcid":null},"institutions":[{"id":"https://openalex.org/I170239107","display_name":"University of South Australia","ror":"https://ror.org/01p93h210","country_code":"AU","type":"education","lineage":["https://openalex.org/I170239107"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Terence Chan","raw_affiliation_strings":["Institute for Telecommunications Research, University of South Australia, Adelaide, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Telecommunications Research, University of South Australia, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I170239107"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9806,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.88286638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"62","issue":"4","first_page":"1850","last_page":"1865"},"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.9961000084877014,"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.9961000084877014,"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.0005000000237487257,"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"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.0005000000237487257,"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.6940000057220459},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.534500002861023},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5051000118255615},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.46459999680519104},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4627000093460083},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4302000105381012},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42890000343322754},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4106999933719635},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.39739999175071716}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6940000057220459},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.534500002861023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5180000066757202},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5051000118255615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4674000144004822},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.46459999680519104},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4627000093460083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43630000948905945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43299999833106995},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4302000105381012},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42890000343322754},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4106999933719635},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35580000281333923},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.3425000011920929},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.33809998631477356},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3343999981880188},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.3305000066757202},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3287000060081482},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31690001487731934},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.2992999851703644},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.290800005197525},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26600000262260437}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2016.2529643","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2016.2529643","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1305.3706","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1305.3706","pdf_url":"https://arxiv.org/pdf/1305.3706","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1305.3706","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1305.3706","pdf_url":"https://arxiv.org/pdf/1305.3706","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":[{"id":"https://openalex.org/G8333092593","display_name":"Coding for Distributed Storage: Fundamental Limits and Code Designs","funder_award_id":"DP150103658","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W646142101","https://openalex.org/W1515040589","https://openalex.org/W1912216824","https://openalex.org/W1965124840","https://openalex.org/W2008561406","https://openalex.org/W2026482663","https://openalex.org/W2080538446","https://openalex.org/W2080663793","https://openalex.org/W2088908785","https://openalex.org/W2097509373","https://openalex.org/W2099755158","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2113578340","https://openalex.org/W2114325434","https://openalex.org/W2121205191","https://openalex.org/W2137690813","https://openalex.org/W2140678653","https://openalex.org/W2140785822","https://openalex.org/W2147101953","https://openalex.org/W2147681281","https://openalex.org/W2147953060","https://openalex.org/W2152093244","https://openalex.org/W2171376656","https://openalex.org/W3098978124","https://openalex.org/W4212896000","https://openalex.org/W4230830692"],"related_works":[],"abstract_inverted_index":{"Explicit":[0],"characterization":[1,84],"of":[2,6,27,44,47,73,83,87,110,124,151],"the":[3,25,36,42,45,53,80,96,103,108,122,149,171,180,183],"capacity":[4,39],"region":[5,40],"communication":[7,104],"networks":[8,143,159,189,195],"is":[9,15,30,59],"a":[10,71],"long-standing":[11],"problem.":[12],"While":[13],"it":[14],"known":[16,32,55,97,184],"that":[17,175],"network":[18,37,74],"coding":[19,38],"can":[20],"outperform":[21],"routing":[22],"and":[23,85,135,193],"replication,":[24],"set":[26,46],"feasible":[28],"rates":[29],"not":[31],"in":[33,61,68,170],"general.":[34],"Characterizing":[35],"requires":[41],"determination":[43],"all":[48,125],"entropic":[49],"vectors.":[50],"Furthermore,":[51],"computing":[52],"explicitly":[54],"linear":[56],"programming":[57],"bound":[58,141],"infeasible":[60],"practice":[62],"due":[63],"to":[64],"an":[65,137],"exponential":[66],"growth":[67],"complexity":[69],"as":[70,132],"function":[72],"size.":[75],"This":[76],"paper":[77],"focuses":[78],"on":[79],"fundamental":[81],"problems":[82],"computation":[86,123],"outer":[88,140,156],"bounds":[89,166,169,178,187],"for":[90,121,142,158,188,194],"multi-source":[91],"multi-sink":[92],"networks.":[93],"Starting":[94],"from":[95],"local":[98],"functional":[99,116],"dependence":[100],"induced":[101],"by":[102],"network,":[105],"we":[106],"introduce":[107],"notion":[109,150],"irreducible":[111,127,152],"sets,":[112],"which":[113],"characterize":[114],"implied":[115],"dependence.":[117],"We":[118,147,163,173],"provide":[119,136],"recursions":[120],"maximal":[126],"sets.":[128],"These":[129],"sets":[130,153],"act":[131],"information-theoretic":[133],"bottlenecks,":[134],"easily":[138],"computable":[139],"with":[144,160,167,190,196],"correlated":[145,191],"sources.":[146,162,198],"extend":[148],"(and":[154],"resulting":[155],"bound)":[157],"independent":[161,197],"compare":[164],"our":[165,176],"existing":[168],"literature.":[172],"find":[174],"new":[177],"are":[179],"best":[181],"among":[182],"graph":[185],"theoretic":[186],"sources":[192]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2016-06-24T00:00:00"}