{"id":"https://openalex.org/W2749114556","doi":"https://doi.org/10.1137/15m1052202","title":"Capacity of Interactive Communication over Erasure Channels and Channels with Feedback","display_name":"Capacity of Interactive Communication over Erasure Channels and Channels with Feedback","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2749114556","doi":"https://doi.org/10.1137/15m1052202","mag":"2749114556"},"language":"en","primary_location":{"id":"doi:10.1137/15m1052202","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1052202","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5085059786","display_name":"Ran Gelles","orcid":"https://orcid.org/0000-0003-3615-3239"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ran Gelles","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085059786"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9084,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.7698302,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"46","issue":"4","first_page":"1449","last_page":"1472"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9997000098228455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.7909560799598694},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6174497604370117},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.597176194190979},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5272811055183411},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4653628170490265},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.449863463640213},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.44910547137260437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44004976749420166},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4363485276699066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.426209419965744},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37122970819473267},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3261142373085022},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.24516180157661438},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.18845099210739136},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.16005337238311768}],"concepts":[{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.7909560799598694},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6174497604370117},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.597176194190979},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5272811055183411},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4653628170490265},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.449863463640213},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.44910547137260437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44004976749420166},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4363485276699066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.426209419965744},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37122970819473267},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3261142373085022},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.24516180157661438},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.18845099210739136},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.16005337238311768},{"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.1137/15m1052202","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1052202","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7442669385","display_name":null,"funder_award_id":"CCF-1527110","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7659139977","display_name":null,"funder_award_id":"CCF-1618280","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1981068980","https://openalex.org/W2014944833","https://openalex.org/W2019807548","https://openalex.org/W2115551261","https://openalex.org/W2118055209","https://openalex.org/W2145385126","https://openalex.org/W2163137752","https://openalex.org/W2164684058","https://openalex.org/W2171601298","https://openalex.org/W2216201412","https://openalex.org/W2419372578","https://openalex.org/W2481902600","https://openalex.org/W2978725006"],"related_works":["https://openalex.org/W2115811863","https://openalex.org/W2372190485","https://openalex.org/W1848880869","https://openalex.org/W2583282232","https://openalex.org/W2962908977","https://openalex.org/W1568966867","https://openalex.org/W2140357074","https://openalex.org/W2014314340","https://openalex.org/W2113562070","https://openalex.org/W2953350338"],"abstract_inverted_index":{"We":[0],"consider":[1],"interactive":[2,47,72,117],"communication":[3,73,118,137],"performed":[4],"over":[5,120],"two":[6],"types":[7],"of":[8,33,63,93],"noisy":[9,121],"channels:":[10],"binary":[11,18],"error":[12,80],"channels":[13,81,122],"with":[14,49,123],"noiseless":[15],"feedback":[16],"and":[17,58,95,124],"erasure":[19],"channels.":[20],"In":[21],"both":[22],"cases,":[23],"the":[24,34,71,86,134],"noise":[25],"model":[26],"is":[27],"adversarial.":[28],"Assuming":[29],"at":[30],"most":[31],"$\\varepsilon$-fraction":[32],"bits":[35],"can":[36],"be":[37,107],"corrupted,":[38],"we":[39],"show":[40],"coding":[41,65,89],"schemes":[42,66,90],"that":[43],"simulate":[44],"any":[45],"alternating":[46],"protocol":[48],"rate":[50],"$1-\\Theta(H(\\varepsilon))$.":[51],"All":[52],"our":[53,64,109],"simulations":[54],"are":[55,104],"simple,":[56],"randomized,":[57],"computationally":[59],"efficient.":[60],"The":[61],"rates":[62,74,92,103,119],"stand":[67],"in":[68,133],"contrast":[69],"to":[70,106],"supported":[75],"by":[76],"random":[77],"or":[78],"adversarial":[79],"without":[82,125],"feedback,":[83],"for":[84],"which":[85],"best":[87],"known":[88],"achieve":[91],"$1-\\Theta(\\sqrt{\\varepsilon})$":[94],"$1-\\Theta(\\sqrt{\\varepsilon":[96],"\\log":[97,98],"1/\\varepsilon})$,":[99],"respectively.":[100],"As":[101],"these":[102],"conjectured":[105],"optimal,":[108],"result":[110],"implies":[111],"a":[112,128],"large":[113],"asymptotic":[114],"gap":[115,129],"between":[116],"feedback.":[126],"Such":[127],"has":[130],"no":[131],"equivalent":[132],"standard":[135],"one-way":[136],"setting.":[138]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}