{"id":"https://openalex.org/W1996260141","doi":"https://doi.org/10.1109/allerton.2014.7028553","title":"Chop and roll: Improving the cutset bound","display_name":"Chop and roll: Improving the cutset bound","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W1996260141","doi":"https://doi.org/10.1109/allerton.2014.7028553","mag":"1996260141"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2014.7028553","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028553","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd 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/A5044647069","display_name":"Sudeep Kamath","orcid":"https://orcid.org/0000-0002-9907-6632"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudeep Kamath","raw_affiliation_strings":["Department of Electrical Engineering, Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101647166","display_name":"Young-Han Kim","orcid":"https://orcid.org/0000-0001-7255-8757"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Young-Han Kim","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, San Diego","Department of Electrical and Computer Engineering, University of California San Diego#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, San Diego","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California San Diego#TAB#","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7598,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.91370917,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"57","issue":null,"first_page":"921","last_page":"927"},"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.9997000098228455,"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.9997000098228455,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9948999881744385,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9929999709129333,"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/partition","display_name":"Partition (number theory)","score":0.8420883417129517},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7833113074302673},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.6536752581596375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5267117619514465},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5161303281784058},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.46857213973999023},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3781074285507202},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37602484226226807},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37022829055786133},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36488187313079834},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15754082798957825}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.8420883417129517},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7833113074302673},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.6536752581596375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5267117619514465},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5161303281784058},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.46857213973999023},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3781074285507202},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37602484226226807},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37022829055786133},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36488187313079834},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15754082798957825},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2014.7028553","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028553","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd 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":25,"referenced_works":["https://openalex.org/W1494099594","https://openalex.org/W1967739115","https://openalex.org/W1984595105","https://openalex.org/W2002531683","https://openalex.org/W2002649876","https://openalex.org/W2018640312","https://openalex.org/W2026026955","https://openalex.org/W2069338257","https://openalex.org/W2099061975","https://openalex.org/W2105831729","https://openalex.org/W2109962983","https://openalex.org/W2132100261","https://openalex.org/W2137775453","https://openalex.org/W2138928022","https://openalex.org/W2140911775","https://openalex.org/W2145518237","https://openalex.org/W2150815458","https://openalex.org/W2151393719","https://openalex.org/W2156939381","https://openalex.org/W2962970001","https://openalex.org/W3016530791","https://openalex.org/W4213060883","https://openalex.org/W4300840296","https://openalex.org/W6675192803","https://openalex.org/W6681130209"],"related_works":["https://openalex.org/W1585007175","https://openalex.org/W2109986081","https://openalex.org/W2382521049","https://openalex.org/W2144385241","https://openalex.org/W4297589944","https://openalex.org/W2417308975","https://openalex.org/W4300101996","https://openalex.org/W2165950148","https://openalex.org/W4253593777","https://openalex.org/W2279165687"],"abstract_inverted_index":{"A":[0],"new":[1,67],"outer":[2],"bound":[3,19,52,68,92,103,116,138],"on":[4],"the":[5,25,28,36,47,60,74,87,101,113,133,136],"capacity":[6],"region":[7],"of":[8,24,46,63,83],"a":[9,56,128],"general":[10,75],"noisy":[11],"network":[12,76,89],"with":[13],"multiple":[14],"messages":[15],"is":[16,53,125],"established.":[17],"The":[18,49,66],"considers":[20],"an":[21,32],"ordered":[22],"partition":[23,61],"nodes":[26],"in":[27],"network,":[29],"and":[30,41,99,110,112,122],"has":[31],"intuitive":[33],"interpretation":[34],"as":[35,55],"directed":[37],"information":[38],"between":[39],"inputs":[40],"outputs":[42],"across":[43],"these":[44],"subsets":[45],"partition.":[48],"standard":[50],"cutset":[51,115,137],"recovered":[54],"special":[57,81],"case":[58],"when":[59],"consists":[62],"two":[64],"subsets.":[65],"extends":[69],"several":[70],"existing":[71],"bounds":[72],"to":[73],"that":[77,132],"were":[78],"obtained":[79],"for":[80,93,104,117],"classes":[82],"networks.":[84],"Examples":[85],"include":[86],"generalized":[88,114],"sharing":[90],"(GNS)":[91],"graphical":[94],"networks":[95,106,119],"by":[96,107,120,127],"Kamath,":[97,108],"Tse,":[98],"Anantharam,":[100],"GNS":[102],"Gaussian":[105],"Kannan,":[109],"Viswanath,":[111],"deterministic":[118],"Shomorony":[121],"Avestimehr.":[123],"It":[124],"demonstrated":[126],"few":[129],"simple":[130],"examples":[131],"improvement":[134],"over":[135],"can":[139],"be":[140],"significant.":[141]},"counts_by_year":[{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}