{"id":"https://openalex.org/W1648801759","doi":"https://doi.org/10.1109/isit.2015.7282486","title":"Capacity regions of two-user broadcast erasure channels with feedback and hidden memory","display_name":"Capacity regions of two-user broadcast erasure channels with feedback and hidden memory","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1648801759","doi":"https://doi.org/10.1109/isit.2015.7282486","mag":"1648801759"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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/A5064664029","display_name":"Michael Heindlmaier","orcid":"https://orcid.org/0000-0002-2441-1985"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Heindlmaier","raw_affiliation_strings":["Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","[Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany]"],"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"[Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany]","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080725457","display_name":"Shirin Saeedi Bidokhti","orcid":"https://orcid.org/0000-0002-3790-202X"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Shirin Saeedi Bidokhti","raw_affiliation_strings":["Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","[Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany]"],"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"[Institute for Communications Engineering, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany]","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064664029"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.9985,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7869538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"406","last_page":"410"},"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.9998999834060669,"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.9998999834060669,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9976999759674072,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9973999857902527,"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/erasure","display_name":"Erasure","score":0.8757297396659851},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7015799283981323},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6717134714126587},{"id":"https://openalex.org/keywords/transmitter","display_name":"Transmitter","score":0.6585747003555298},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6439409255981445},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.589633047580719},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5710472464561462},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.539253830909729},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5119627714157104},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5095341801643372},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5016791820526123},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.49398595094680786},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.37695974111557007},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22676706314086914},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2233087420463562},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10570526123046875}],"concepts":[{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.8757297396659851},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7015799283981323},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6717134714126587},{"id":"https://openalex.org/C47798520","wikidata":"https://www.wikidata.org/wiki/Q190157","display_name":"Transmitter","level":3,"score":0.6585747003555298},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6439409255981445},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.589633047580719},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5710472464561462},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.539253830909729},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5119627714157104},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5095341801643372},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5016791820526123},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.49398595094680786},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.37695974111557007},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22676706314086914},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2233087420463562},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10570526123046875},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1639669715","https://openalex.org/W1648801759","https://openalex.org/W1986861530","https://openalex.org/W1989008275","https://openalex.org/W2043890573","https://openalex.org/W2058908188","https://openalex.org/W2072270486","https://openalex.org/W2081156570","https://openalex.org/W2082851808","https://openalex.org/W2105177639","https://openalex.org/W2117423557","https://openalex.org/W2129885443","https://openalex.org/W2142270203","https://openalex.org/W2157721994","https://openalex.org/W2555338699","https://openalex.org/W2964229817","https://openalex.org/W3105807832","https://openalex.org/W4301852635"],"related_works":["https://openalex.org/W2372190485","https://openalex.org/W2139769859","https://openalex.org/W2583282232","https://openalex.org/W2140357074","https://openalex.org/W2113562070","https://openalex.org/W2810502498","https://openalex.org/W2743670993","https://openalex.org/W2028268383","https://openalex.org/W2809708642","https://openalex.org/W2317166921"],"abstract_inverted_index":{"The":[0,24,59,88,117],"two-receiver":[1],"broadcast":[2],"packet":[3],"erasure":[4],"channel":[5,22,25],"with":[6],"feedback":[7,104],"and":[8,48,53,68,81],"memory":[9],"is":[10,13,27,57,91,120],"studied.":[11],"Memory":[12],"modelled":[14],"using":[15],"a":[16,21,65,92,121],"finite-state":[17],"Markov":[18,37],"chain":[19,38],"representing":[20],"state.":[23],"state":[26],"unknown":[28],"at":[29,41],"the":[30,42,54,76,101,110,128],"transmitter,":[31],"but":[32],"observations":[33],"of":[34,75],"this":[35,71],"hidden":[36],"are":[39,51,79,86],"available":[40],"transmitter":[43],"through":[44],"feedback.":[45],"Matching":[46],"outer":[47],"inner":[49],"bounds":[50],"derived":[52],"capacity":[55,60,77,111],"region":[56,61,78,112],"determined.":[58],"does":[62],"not":[63],"have":[64],"single-letter":[66],"characterization":[67],"is,":[69],"in":[70,115,127],"sense,":[72],"uncomputable.":[73],"Approximations":[74],"provided":[80],"two":[82],"optimal":[83],"coding":[84,94],"algorithms":[85],"outlined.":[87],"first":[89],"algorithm":[90,119,123],"probabilistic":[93],"scheme":[95],"that":[96,124],"bases":[97],"its":[98],"decisions":[99],"on":[100],"past":[102],"L":[103],"sequences.":[105],"Its":[106],"achievable":[107],"rate-region":[108],"approaches":[109],"exponentially":[113],"fast":[114],"L.":[116],"second":[118],"backpressure-like":[122],"performs":[125],"optimally":[126],"long":[129],"run.":[130]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}