{"id":"https://openalex.org/W2118377696","doi":"https://doi.org/10.1109/isit.2009.5205600","title":"A generalized cut-set bound","display_name":"A generalized cut-set bound","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2118377696","doi":"https://doi.org/10.1109/isit.2009.5205600","mag":"2118377696"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205600","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5015573260","display_name":"Amin Gohari","orcid":"https://orcid.org/0000-0002-9667-7627"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Amin Aminzadeh Gohari","raw_affiliation_strings":["EECS Department, University of California, Berkeley, CA, USA","EECS Department University of California, Berkeley, 94720, USA"],"affiliations":[{"raw_affiliation_string":"EECS Department, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"EECS Department University of California, Berkeley, 94720, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013689450","display_name":"Venkat Anantharam","orcid":"https://orcid.org/0000-0002-6214-7927"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkat Anantharam","raw_affiliation_strings":["EECS Department, University of California, Berkeley, CA, USA","EECS Department University of California, Berkeley, 94720, USA"],"affiliations":[{"raw_affiliation_string":"EECS Department, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"EECS Department University of California, Berkeley, 94720, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015573260"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":1.5229,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84129036,"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":"99","last_page":"103"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9983999729156494,"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/T12029","display_name":"DNA and Biological Computing","score":0.9768000245094299,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.8649731874465942},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6510000228881836},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6199016571044922},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.528210461139679},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4921824038028717},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4720340967178345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42770716547966003},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4243374466896057},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37120383977890015},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.36318665742874146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3340514302253723},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.13702720403671265},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13519740104675293},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12533515691757202}],"concepts":[{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.8649731874465942},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6510000228881836},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6199016571044922},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.528210461139679},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4921824038028717},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4720340967178345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42770716547966003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4243374466896057},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37120383977890015},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.36318665742874146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3340514302253723},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.13702720403671265},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13519740104675293},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12533515691757202},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit.2009.5205600","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.152.2157","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.2157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.berkeley.edu/~aminzade/CutSetFinal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.152.2350","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.2350","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.berkeley.edu/~ananth/2008+/ISIT2009CutsetFinal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.315.3685","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.315.3685","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/0904.4542v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2026641099","https://openalex.org/W2038457670","https://openalex.org/W2099111195","https://openalex.org/W2118377696","https://openalex.org/W2123976939","https://openalex.org/W2140227342","https://openalex.org/W2144970857","https://openalex.org/W2153411396","https://openalex.org/W2156840794","https://openalex.org/W2164651000","https://openalex.org/W2539443493"],"related_works":["https://openalex.org/W1995805316","https://openalex.org/W2387503788","https://openalex.org/W2059658550","https://openalex.org/W50067980","https://openalex.org/W2803920876","https://openalex.org/W2999957348","https://openalex.org/W2964219139","https://openalex.org/W4287903946","https://openalex.org/W3042625184","https://openalex.org/W2343292875"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"generalize":[4],"the":[5,17],"well":[6],"known":[7],"cutset":[8],"bound":[9],"(see":[10],"for":[11],"example":[12],"[1,":[13],"p.":[14],"444])":[15],"to":[16],"problem":[18],"of":[19,22,24],"lossy":[20],"transmission":[21],"functions":[23],"arbitrarily":[25],"correlated":[26],"sources":[27],"over":[28],"a":[29],"discrete":[30],"memoryless":[31],"multiterminal":[32],"network.":[33]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}