{"id":"https://openalex.org/W2017970192","doi":"https://doi.org/10.1109/isit.2009.5205982","title":"A new achievable rate region for the discrete memoryless multiple-access channel with feedback","display_name":"A new achievable rate region for the discrete memoryless multiple-access channel with feedback","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2017970192","doi":"https://doi.org/10.1109/isit.2009.5205982","mag":"2017970192"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205982","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205982","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/A5081409970","display_name":"Ramji Venkataramanan","orcid":"https://orcid.org/0000-0001-7915-5432"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ramji Venkataramanan","raw_affiliation_strings":["Department of Electrical Engineering, University of Stanford, USA","[Department of Electrical Engineering Stanford University, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Stanford, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"[Department of Electrical Engineering Stanford University, USA]","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012221966","display_name":"S. Sandeep Pradhan","orcid":"https://orcid.org/0000-0001-8406-4404"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Sandeep Pradhan","raw_affiliation_strings":["Department of Electrical Engineering & Computer Science, University of Michigan, Ann Arbor, USA","Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering & Computer Science, University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081409970"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":2.7412,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.90070665,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":1.0,"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":1.0,"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.9994999766349792,"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/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9980999827384949,"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/block","display_name":"Block (permutation group theory)","score":0.73722243309021},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6374280452728271},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6165318489074707},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6072176694869995},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6017409563064575},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.5921772718429565},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.4913140833377838},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.48520663380622864},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.47459647059440613},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.45598652958869934},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.44932207465171814},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.4461730122566223},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38840189576148987},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33197638392448425},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3239598572254181},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.26539120078086853},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.22365480661392212},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0912676453590393},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07446599006652832}],"concepts":[{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.73722243309021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6374280452728271},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6165318489074707},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6072176694869995},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6017409563064575},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.5921772718429565},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.4913140833377838},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.48520663380622864},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.47459647059440613},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.45598652958869934},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.44932207465171814},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.4461730122566223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38840189576148987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33197638392448425},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3239598572254181},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26539120078086853},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.22365480661392212},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0912676453590393},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07446599006652832},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2009.5205982","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205982","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.172.7431","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.172.7431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/%7Epradhanv/paper/isit09_1.pdf","raw_type":"text"},{"id":"pmh:oai:generic.eprints.org:528984","is_oa":false,"landing_page_url":"http://publications.eng.cam.ac.uk/528984/","pdf_url":null,"source":{"id":"https://openalex.org/S4406922847","display_name":"Cambridge University Engineering Department Publications Database","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W369446440","https://openalex.org/W1489262227","https://openalex.org/W1592482298","https://openalex.org/W2014996477","https://openalex.org/W2069694073","https://openalex.org/W2077129893","https://openalex.org/W2122195511","https://openalex.org/W2129885443","https://openalex.org/W2143652864","https://openalex.org/W2144970857","https://openalex.org/W2162935207","https://openalex.org/W2164356790","https://openalex.org/W3173652044","https://openalex.org/W6635532581"],"related_works":["https://openalex.org/W4310170797","https://openalex.org/W1560346101","https://openalex.org/W2349784001","https://openalex.org/W2383340439","https://openalex.org/W2100019864","https://openalex.org/W3095223619","https://openalex.org/W4320870137","https://openalex.org/W2327678847","https://openalex.org/W4226289642","https://openalex.org/W2009895812"],"abstract_inverted_index":{"A":[0],"single-letter":[1],"achievable":[2],"rate":[3,15],"region":[4,16],"for":[5,60],"the":[6,18,26,39,42,45,51,65,70,78,85,94,99,103,115],"two-user":[7],"discrete":[8],"memoryless":[9],"multiple-access":[10],"channel":[11],"is":[12,23,28],"proposed.":[13],"The":[14,30,53,133],"includes":[17],"Cover-Leung":[19,116],"region,":[20],"and":[21,125],"it":[22],"shown":[24],"that":[25,41],"inclusion":[27],"strict.":[29],"proof":[31],"uses":[32],"a":[33,111,119,126],"block-Markov":[34],"superposition":[35],"strategy":[36],"based":[37],"on":[38],"observation":[40],"messages":[43],"of":[44,55,87,102,114,121,128],"two":[46],"users":[47],"are":[48,57],"correlated":[49,75],"given":[50],"feedback.":[52],"rates":[54],"transmission":[56],"too":[58],"high":[59],"each":[61],"encoder":[62],"to":[63,83,97,139],"decode":[64],"other's":[66],"message":[67,86],"directly":[68],"using":[69],"feedback,":[71],"so":[72],"they":[73],"transmit":[74],"information":[76],"in":[77,81,93],"next":[79],"block":[80,96,124],"order":[82],"learn":[84],"one":[88,122],"another.":[89],"They":[90],"then":[91],"cooperate":[92],"following":[95],"resolve":[98],"residual":[100],"uncertainty":[101],"decoder.":[104],"Our":[105],"scheme":[106,117,134],"may":[107],"be":[108,137],"viewed":[109],"as":[110],"natural":[112],"generalization":[113],"with":[118,143],"delay":[120],"extra":[123],"pair":[127],"additional":[129],"auxiliary":[130,145],"random":[131,146],"variables.":[132,147],"can":[135],"also":[136],"extended":[138],"obtain":[140],"larger":[141],"rate-regions":[142],"more":[144]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
