{"id":"https://openalex.org/W2744401243","doi":"https://doi.org/10.1109/isit.2017.8006688","title":"On the capacity region of the K-user discrete memoryless broadcast channel with two degraded messages","display_name":"On the capacity region of the K-user discrete memoryless broadcast channel with two degraded messages","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2744401243","doi":"https://doi.org/10.1109/isit.2017.8006688","mag":"2744401243"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006688","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5020941540","display_name":"Mohamed Salman","orcid":"https://orcid.org/0000-0002-9875-450X"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohamed Salman","raw_affiliation_strings":["Electrical Computer and Energy Engineering Department, University of Colorado, Boulder, CO, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Computer and Energy Engineering Department, University of Colorado, Boulder, CO, USA","institution_ids":["https://openalex.org/I188538660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014994394","display_name":"Mahesh K. Varanasi","orcid":"https://orcid.org/0000-0001-6686-8898"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mahesh K. Varanasi","raw_affiliation_strings":["Electrical Computer and Energy Engineering Department, University of Colorado, Boulder, CO, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Computer and Energy Engineering Department, University of Colorado, Boulder, CO, USA","institution_ids":["https://openalex.org/I188538660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020941540"],"corresponding_institution_ids":["https://openalex.org/I188538660"],"apc_list":null,"apc_paid":null,"fwci":0.43,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65131643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":null,"first_page":"1048","last_page":"1052"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.794965386390686},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6716241240501404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5799933671951294},{"id":"https://openalex.org/keywords/superposition-principle","display_name":"Superposition principle","score":0.5586402416229248},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5478951930999756},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5298920273780823},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.472664475440979},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44698217511177063},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.441129595041275},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4140980541706085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35435932874679565},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34796175360679626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3455466330051422},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1312676966190338},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07576653361320496},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0730302631855011}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.794965386390686},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6716241240501404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5799933671951294},{"id":"https://openalex.org/C27753989","wikidata":"https://www.wikidata.org/wiki/Q284885","display_name":"Superposition principle","level":2,"score":0.5586402416229248},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5478951930999756},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5298920273780823},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.472664475440979},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44698217511177063},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.441129595041275},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4140980541706085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35435932874679565},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34796175360679626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3455466330051422},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1312676966190338},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07576653361320496},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0730302631855011},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/isit.2017.8006688","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.46000000834465027,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2082063730","https://openalex.org/W2135536003","https://openalex.org/W2143504028","https://openalex.org/W2144007657","https://openalex.org/W2157639858","https://openalex.org/W2171110488"],"related_works":["https://openalex.org/W2368824897","https://openalex.org/W1508050556","https://openalex.org/W1910862367","https://openalex.org/W2379365082","https://openalex.org/W2370747590","https://openalex.org/W2030109976","https://openalex.org/W2369260257","https://openalex.org/W2389120450","https://openalex.org/W55249799","https://openalex.org/W4242191701"],"abstract_inverted_index":{"The":[0,33,65,170],"K-user":[1],"discrete":[2],"memoryless":[3],"(DM)":[4],"broadcast":[5],"channel":[6],"(BC)":[7],"with":[8,12],"two":[9,62,73,137,152],"degraded":[10],"messages,":[11],"one":[13,67],"common":[14,55,58,90,149],"message":[15,25,56],"to":[16,42,135],"be":[17],"decoded":[18],"by":[19,26,79,96,114],"all":[20],"receivers":[21,34,45],"and":[22,46,87,91,101,117,146,188,191],"a":[23,27,142,147,175,198],"private":[24,44,92,144],"subset":[28],"of":[29,72,75,83,130,141,201],"receivers,":[30,93],"is":[31,112,174],"studied.":[32],"that":[35,50,121,182],"must":[36],"decode":[37,53],"both":[38,106],"messages":[39],"are":[40,155],"referred":[41],"as":[43,57,157,159],"the":[47,54,69,80,89,97,109,122,128,131,136,151],"remaining":[48],"ones":[49],"need":[51],"only":[52],"receivers.":[59],"We":[60],"obtain":[61],"main":[63,123,172],"results.":[64],"first":[66],"establishes":[68],"capacity":[70,110,166,195],"region":[71,111],"classes":[74,154],"DM":[76,203],"BCs":[77],"characterized":[78],"associated":[81],"sets":[82],"pair-wise":[84],"relationships":[85],"between":[86],"among":[88],"each":[94],"described":[95],"well-known":[98],"more":[99],"capable":[100],"less":[102],"noisy":[103],"conditions.":[104],"For":[105],"these":[107],"classes,":[108],"achieved":[113],"superposition":[115,186],"coding":[116],"joint":[118],"decoding":[119,190],"so":[120],"contribution":[124],"herein":[125],"lies":[126],"in":[127,179],"proofs":[129],"converses.":[132],"When":[133],"specialized":[134],"previously":[138,168],"well-studied":[139],"cases":[140],"single":[143,148],"receiver":[145],"receiver,":[150],"aforementioned":[153],"respectively":[156],"large":[158],"or":[160],"larger":[161],"than":[162],"those":[163],"for":[164,197],"which":[165],"was":[167],"obtained.":[169],"second":[171],"result":[173],"new":[176,199],"inner":[177],"bound":[178],"closed":[180],"form":[181],"involves":[183],"rate":[184],"splitting,":[185],"coding,":[187],"indirect":[189],"we":[192],"state":[193],"its":[194],"optimality":[196],"class":[200],"four-receiver":[202],"BCs.":[204]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}