{"id":"https://openalex.org/W2099030119","doi":"https://doi.org/10.1109/ciss.2006.286470","title":"An Outer Bound for Multiple Access Channels with Correlated Sources","display_name":"An Outer Bound for Multiple Access Channels with Correlated Sources","publication_year":2006,"publication_date":"2006-03-01","ids":{"openalex":"https://openalex.org/W2099030119","doi":"https://doi.org/10.1109/ciss.2006.286470","mag":"2099030119"},"language":"en","primary_location":{"id":"doi:10.1109/ciss.2006.286470","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2006.286470","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 40th Annual Conference on Information Sciences and Systems","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/A5024845943","display_name":"Wei Kang","orcid":"https://orcid.org/0000-0003-4408-6419"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wei Kang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD","Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742. wkang@eng.umd.edu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742. wkang@eng.umd.edu","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021132487","display_name":"\u015eennur Uluku\u015f","orcid":"https://orcid.org/0000-0002-8219-8190"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sennur Ulukus","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD","Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, ulukus@umd.edu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, ulukus@umd.edu","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":6.7944,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.97809716,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"240","last_page":"244"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.8948452472686768},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6567547917366028},{"id":"https://openalex.org/keywords/mutual-information","display_name":"Mutual information","score":0.639741063117981},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5931587219238281},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5823442339897156},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.5748059749603271},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5663782954216003},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5421032309532166},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5163358449935913},{"id":"https://openalex.org/keywords/converse-theorem","display_name":"Converse theorem","score":0.5125420093536377},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.5031213164329529},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4521881639957428},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.44394105672836304},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4229617118835449},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.420733243227005},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35315757989883423},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.2248978614807129},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.2207222878932953},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10138532519340515},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.0916714072227478},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0903472900390625},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0778142511844635}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.8948452472686768},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6567547917366028},{"id":"https://openalex.org/C152139883","wikidata":"https://www.wikidata.org/wiki/Q252973","display_name":"Mutual information","level":2,"score":0.639741063117981},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5931587219238281},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5823442339897156},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.5748059749603271},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5663782954216003},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5421032309532166},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5163358449935913},{"id":"https://openalex.org/C204591131","wikidata":"https://www.wikidata.org/wiki/Q5166461","display_name":"Converse theorem","level":3,"score":0.5125420093536377},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.5031213164329529},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4521881639957428},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.44394105672836304},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4229617118835449},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.420733243227005},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35315757989883423},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.2248978614807129},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.2207222878932953},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10138532519340515},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0916714072227478},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0903472900390625},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0778142511844635},{"id":"https://openalex.org/C132817261","wikidata":"https://www.wikidata.org/wiki/Q1134435","display_name":"Automorphic form","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ciss.2006.286470","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2006.286470","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 40th Annual Conference on Information Sciences and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.134.9887","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.9887","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.umd.edu/~ulukus/papers/conf/ciss06.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.143.8155","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.8155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.umd.edu/~ravit/IT_MAC-FB-2008.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1999367302","https://openalex.org/W2099111195","https://openalex.org/W2114871545","https://openalex.org/W2144970857","https://openalex.org/W2170862660","https://openalex.org/W6677421189"],"related_works":["https://openalex.org/W2144181412","https://openalex.org/W4394651134","https://openalex.org/W3033882599","https://openalex.org/W2136333882","https://openalex.org/W2342098551","https://openalex.org/W2990876408","https://openalex.org/W2975771407","https://openalex.org/W1986206926","https://openalex.org/W2910215732","https://openalex.org/W1984199859"],"abstract_inverted_index":{"The":[0],"capacity":[1,105,114],"region":[2,23,115],"of":[3,27,49,67,116],"the":[4,25,64,81,86,99,103,113,117],"multiple":[5,118],"access":[6,119],"channel":[7,69,88,120],"with":[8,121],"correlated":[9,122],"sources":[10,123],"remains":[11],"an":[12,21,60,109],"open":[13],"problem.":[14],"Cover,":[15,38],"El":[16,39],"Gamal":[17,40],"and":[18,30,41],"Salehi":[19,42],"gave":[20],"achievable":[22],"in":[24,47,70,124],"form":[26],"single-letter":[28,36,72],"entropy":[29],"mutual":[31,52],"information":[32],"expressions,":[33],"without":[34],"a":[35,45,71,76],"converse.":[37],"also":[43],"suggested":[44],"converse":[46],"terms":[48],"some":[50],"n-letter":[51],"informations,":[53],"which":[54],"are":[55],"incomputable.":[56],"We":[57,107],"have":[58],"proposed":[59],"upper":[61],"bound":[62,111],"for":[63,80,112],"sum":[65,100],"rate":[66,101],"this":[68,92],"expression,":[73],"by":[74],"utilizing":[75],"new":[77],"necessary":[78],"condition":[79],"Markov":[82],"chain":[83],"constraint":[84],"on":[85],"valid":[87],"input":[89],"distributions.":[90],"In":[91],"paper,":[93],"we":[94],"extend":[95],"our":[96],"results":[97],"from":[98],"to":[102],"entire":[104],"region.":[106],"obtain":[108],"outer":[110],"finite-letter":[125],"expressions.":[126]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}