{"id":"https://openalex.org/W4415157419","doi":"https://doi.org/10.4230/lipics.ccc.2026.10","title":"The Rate-Immediacy Barrier in Explicit Tree Code Constructions","display_name":"The Rate-Immediacy Barrier in Explicit Tree Code Constructions","publication_year":2025,"publication_date":"2025-04-13","ids":{"openalex":"https://openalex.org/W4415157419","doi":"https://doi.org/10.4230/lipics.ccc.2026.10"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2504.09388","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2504.09388","pdf_url":"https://arxiv.org/pdf/2504.09388","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2504.09388","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Cohen, Gil","orcid":"https://orcid.org/0000-0003-2409-2192"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Cohen, Gil","raw_affiliation_strings":["Department of Computer Science, Tel Aviv University, Israel"],"raw_orcid":"https://orcid.org/0000-0003-2409-2192","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065859226","display_name":"Leonard J. Schulman","orcid":"https://orcid.org/0000-0001-9901-2797"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Schulman, Leonard J.","raw_affiliation_strings":["E&AS Division, California Institute of Technology, Pasadena, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-9901-2797","affiliations":[{"raw_affiliation_string":"E&AS Division, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101900831","display_name":"Piyush Srivastava","orcid":"https://orcid.org/0000-0003-0953-2890"},"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":"Srivastava, Piyush","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India"],"raw_orcid":"https://orcid.org/0000-0003-0953-2890","affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9577000141143799,"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"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9577000141143799,"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"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9574000239372253,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9121999740600586,"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/tree","display_name":"Tree (set theory)","score":0.6583999991416931},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.44130000472068787},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.42149999737739563},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4025000035762787},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.2694000005722046}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6583999991416931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5378000140190125},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44130000472068787},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.42149999737739563},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4025000035762787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4000000059604645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35910001397132874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35679998993873596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30090001225471497},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2504.09388","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2504.09388","pdf_url":"https://arxiv.org/pdf/2504.09388","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2504.09388","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.09388","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.ccc.2026.10","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.10","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2504.09388","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2504.09388","pdf_url":"https://arxiv.org/pdf/2504.09388","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1355804561","display_name":null,"funder_award_id":"MTR/2023/001547","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"},{"id":"https://openalex.org/G5959949423","display_name":"NSF-BSF: AF: Small: Algorithmic and Information-Theoretic Challenges in Causal Inference","funder_award_id":"2321079","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"},{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Since":[0],"the":[1,34,55,115,141,194,202],"introduction":[2],"of":[3,12,61,69,81,118,133,143,205],"tree":[4,15,96,119,153,218],"codes":[5,16,47,97,207],"by":[6,24,37,114,123],"Schulman":[7,28,65],"(STOC":[8,29,43],"1993),":[9],"explicit":[10],"construction":[11,36,60],"asymptotically":[13,216],"good":[14,217],"has":[17],"remained":[18],"a":[19,91,103,144],"notorious":[20],"challenge.":[21],"A":[22],"work":[23,192],"Cohen,":[25,40],"Haeupler":[26],"and":[27,41,64,127,158],"2018),":[30],"as":[31,33],"well":[32],"state-of-the-art":[35],"Ben":[38],"Yaacov,":[39],"Yankovitz":[42],"2022)":[44],"have":[45,163],"achieved":[46],"with":[48,155],"rate":[49,57,179],"$\u03a9(1/\\log\\log":[50],"n)$,":[51],"exponentially":[52],"improving":[53],"upon":[54],"original":[56,116],"$\u03a9(1/\\log":[58],"n)$":[59],"Evans,":[62],"Klugerman":[63],"from":[66],"1994.":[67],"All":[68],"these":[70],"constructions":[71,126],"rely,":[72],"at":[73],"least":[74],"in":[75,130,148,213],"part,":[76],"on":[77],"increasingly":[78],"sophisticated":[79],"methods":[80],"combining":[82],"(block)":[83],"error-correcting":[84,134,206],"codes.":[85,135,219],"In":[86],"this":[87],"work,":[88],"we":[89,107,174],"identify":[90],"fundamental":[92],"barrier":[93],"to":[94,171,209],"constructing":[95,215],"using":[98],"known":[99,125,178],"techniques.":[100],"We":[101],"introduce":[102],"key":[104],"property":[105],"which":[106],"call":[108],"immediacy,":[109],"that,":[110],"while":[111],"not":[112],"required":[113],"definition":[117],"codes,":[120],"is":[121,140],"shared":[122],"all":[124],"inherently":[128],"arises":[129],"recursive":[131,203],"combinations":[132],"Our":[136],"main":[137],"technical":[138],"contribution":[139],"proof":[142],"rate-immediacy":[145,169],"trade-off,":[146],"which,":[147],"particular,":[149],"implies":[150],"that":[151,176],"any":[152],"code":[154],"constant":[156],"distance":[157],"non-trivial":[159],"immediacy":[160],"must":[161],"necessarily":[162],"vanishing":[164],"rate.":[165],"By":[166],"applying":[167],"our":[168,191],"trade-off":[170],"existing":[172],"constructions,":[173],"establish":[175],"their":[177,185],"analyses":[180],"are":[181],"essentially":[182],"optimal":[183],"given":[184],"actual":[186],"error-correction":[187],"properties.":[188],"More":[189],"broadly,":[190],"highlights":[193],"need":[195],"for":[196],"fundamentally":[197],"new":[198],"ideas":[199],"--":[200,208],"beyond":[201],"use":[204],"achieve":[210],"substantial":[211],"progress":[212],"explicitly":[214]},"counts_by_year":[],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-14T00:00:00"}