{"id":"https://openalex.org/W7128628268","doi":"https://doi.org/10.1109/focs63196.2025.00031","title":"Constant Rate Codes for Adaptive Broadcasts Do Not Exist","display_name":"Constant Rate Codes for Adaptive Broadcasts Do Not Exist","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128628268","doi":"https://doi.org/10.1109/focs63196.2025.00031"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00031","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","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/A5083692440","display_name":"Klim Efremenko","orcid":"https://orcid.org/0000-0003-3280-3927"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Klim Efremenko","raw_affiliation_strings":["Ben-Gurion University,Beersheba,Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University,Beersheba,Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050781652","display_name":"Gillat Kol","orcid":"https://orcid.org/0009-0007-4725-6694"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gillat Kol","raw_affiliation_strings":["Princeton University,Department of Computer Science,Princeton,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University,Department of Computer Science,Princeton,USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114050387","display_name":"Dmitry Paramonov","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dmitry Paramonov","raw_affiliation_strings":["Princeton University,Department of Computer Science,Princeton,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University,Department of Computer Science,Princeton,USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053649149","display_name":"Raghuvansh R. Saxena","orcid":"https://orcid.org/0009-0002-7006-6710"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Raghuvansh R. Saxena","raw_affiliation_strings":["Tata Institute of Fundamental Research,School of Technology and Computer Science,Mumbai,India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research,School of Technology and Computer Science,Mumbai,India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67703614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"565","last_page":"584"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.5372999906539917,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.5372999906539917,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.10040000081062317,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.040300000458955765,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/atomic-broadcast","display_name":"Atomic broadcast","score":0.5845999717712402},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5544999837875366},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.5011000037193298},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.492000013589859},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.48899999260902405},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4684999883174896},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.46050000190734863}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6495000123977661},{"id":"https://openalex.org/C943373","wikidata":"https://www.wikidata.org/wiki/Q4817323","display_name":"Atomic broadcast","level":3,"score":0.5845999717712402},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5544999837875366},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.5011000037193298},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.492000013589859},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.48899999260902405},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4684999883174896},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.46050000190734863},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4458000063896179},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4117000102996826},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.40959998965263367},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.38989999890327454},{"id":"https://openalex.org/C83529365","wikidata":"https://www.wikidata.org/wiki/Q4972103","display_name":"Broadcast communication network","level":2,"score":0.38749998807907104},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.3815000057220459},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3197000026702881},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.289900004863739},{"id":"https://openalex.org/C12269588","wikidata":"https://www.wikidata.org/wiki/Q132364","display_name":"Communications protocol","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.25429999828338623}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00031","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00031","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Can":[0],"the":[1,39,48,58,75,78,117],"n-party":[2],"broadcast":[3,41,50,114,159,163],"channel,":[4],"where":[5,105],"any":[6,35,152],"symbol":[7],"sent":[8],"by":[9,14],"one":[10,44],"party":[11,107],"is":[12,25,53,83,88,135,181],"received":[13,126],"all,":[15],"be":[16],"made":[17],"resilient":[18,99,165],"to":[19,28,90,113,120,166],"noise":[20,98],"with":[21,68],"low":[22],"overhead?":[23],"Namely,":[24],"it":[26,87],"possible":[27,73,136],"construct":[29],"interactive":[30,66,153],"error-correcting":[31],"codes":[32,67],"that":[33,45,64,77,86,151,155],"convert":[34],"protocol":[36,80],"designed":[37],"for":[38,137],"noiseless":[40,79,141,158],"channel":[42,51],"into":[43,161],"works":[46],"over":[47],"noisy":[49],"and":[52,125],"not":[54,112],"much":[55],"longer":[56],"than":[57],"original":[59],"protocol?[12,":[60],"STOC":[61],"2018]":[62],"showed":[63],"such":[65,132],"constant":[69],"multiplicative":[70,172],"overhead":[71,173],"are":[72],"under":[74],"assumption":[76],"being":[81],"simulated":[82],"non-adaptive,":[84],"meaning":[85],"restricted":[89],"have":[91],"a":[92,133,171],"pre-determined":[93],"order":[94],"of":[95,130,174],"turns.":[96],"Their":[97],"simulating":[100],"protocols,":[101],"however,":[102],"require":[103],"adaptivity,":[104],"each":[106],"can":[108],"decide":[109],"whether":[110,131],"or":[111],"given":[115],"all":[116],"information":[118],"available":[119],"them,":[121],"including":[122],"their":[123],"input":[124],"transcript.":[127],"The":[128],"question":[129,148],"simulation":[134],"general,":[138],"potentially":[139],"adaptive,":[140],"protocols":[142,160,164],"was":[143],"left":[144],"open.We":[145],"resolve":[146],"this":[147],"negatively,":[149],"proving":[150],"code":[154],"converts":[156],"adaptive":[157,162],"stochastic":[167],"errors":[168],"must":[169],"incur":[170],"\u03a9(log":[175],"n/":[176],"log":[177,178],"n),":[179],"which":[180],"nearly":[182],"tight.":[183]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-12T00:00:00"}