{"id":"https://openalex.org/W7111201991","doi":"https://doi.org/10.4230/lipics.fsttcs.2025.37","title":"Communication Complexity of Equality and Error-Correcting Codes","display_name":"Communication Complexity of Equality and Error-Correcting Codes","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7111201991","doi":"https://doi.org/10.4230/lipics.fsttcs.2025.37"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25117","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.37/LIPIcs.FSTTCS.2025.37.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.37/LIPIcs.FSTTCS.2025.37.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jacobs, Dale","orcid":"https://orcid.org/0009-0008-2543-1161"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jacobs, Dale","raw_affiliation_strings":["Tufts University, Medford, MA, USA"],"affiliations":[{"raw_affiliation_string":"Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jeang, John","orcid":"https://orcid.org/0009-0003-9634-1095"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeang, John","raw_affiliation_strings":["Tufts University, Medford, MA, USA"],"affiliations":[{"raw_affiliation_string":"Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Podolskii, Vladimir","orcid":"https://orcid.org/0000-0001-7154-138X"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Podolskii, Vladimir","raw_affiliation_strings":["Tufts University, Medford, MA, USA"],"affiliations":[{"raw_affiliation_string":"Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Prior, Morgan","orcid":"https://orcid.org/0009-0003-1553-1672"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prior, Morgan","raw_affiliation_strings":["Tufts University, Medford, MA, USA"],"affiliations":[{"raw_affiliation_string":"Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"last","author":{"id":null,"display_name":"Volkovich, Ilya","orcid":"https://orcid.org/0000-0002-7616-0751"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Volkovich, Ilya","raw_affiliation_strings":["Boston College, MA, USA"],"affiliations":[{"raw_affiliation_string":"Boston College, MA, USA","institution_ids":["https://openalex.org/I103531236"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I121934306"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67925543,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9710999727249146,"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.9710999727249146,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.005400000140070915,"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/T10237","display_name":"Cryptography and Data Security","score":0.004900000058114529,"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/communication-complexity","display_name":"Communication complexity","score":0.7696999907493591},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.7265999913215637},{"id":"https://openalex.org/keywords/probability-of-error","display_name":"Probability of error","score":0.5357000231742859},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5315999984741211},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.44339999556541443},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.43950000405311584},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4156000018119812},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.40619999170303345}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7696999907493591},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.7265999913215637},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.5357000231742859},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5315999984741211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5214999914169312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45100000500679016},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.44339999556541443},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.43950000405311584},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.438400000333786},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4156000018119812},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.40619999170303345},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.3930000066757202},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37959998846054077},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3691999912261963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35179999470710754},{"id":"https://openalex.org/C12269588","wikidata":"https://www.wikidata.org/wiki/Q132364","display_name":"Communications protocol","level":2,"score":0.34220001101493835},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3165999948978424},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.29600000381469727},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.2946999967098236},{"id":"https://openalex.org/C14539891","wikidata":"https://www.wikidata.org/wiki/Q1070305","display_name":"Chernoff bound","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C101765175","wikidata":"https://www.wikidata.org/wiki/Q577764","display_name":"Communications system","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25117","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.37/LIPIcs.FSTTCS.2025.37.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.fsttcs.2025.37","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2025.37","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25117","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.37/LIPIcs.FSTTCS.2025.37.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7429050207138062,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7111201991.pdf","grobid_xml":"https://content.openalex.org/works/W7111201991.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,53,84,181],"study":[1],"the":[2,8,23,29,42,47,66,87,128,135,138,142,149,156,166,170,183],"public-coin":[3,56],"randomized":[4,57,130,157],"communication":[5,12,131,158],"complexity":[6,13,38,159],"of":[7,14,49,119,134,144,160,172],"equality":[9,60,122,161],"function.":[10],"The":[11,37],"this":[15],"function":[16,94],"is":[17,26],"known":[18],"to":[19,33,151,154],"be":[20,101],"low":[21],"when":[22],"error":[24,44,139,167],"probability":[25,45,140,168],"constant":[27],"and":[28,46,61,81,141,169],"players":[30],"have":[31],"access":[32],"many":[34],"random":[35],"bits.":[36],"grows,":[39],"however,":[40],"if":[41],"allowed":[43],"amount":[48,143,171],"randomness":[50],"are":[51,64,189],"restricted.":[52],"show":[54,111],"that":[55,112],"protocols":[58],"for":[59,74,162],"error-correcting":[62,105,152],"codes":[63,153],"essentially":[65],"same":[67],"object.":[68],"That":[69],"is,":[70],"given":[71],"a":[72,79,93,96,108,116],"protocol":[73,91],"equality,":[75],"we":[76,110,147,177],"can":[77,100],"construct":[78],"code,":[80],"vice":[82],"versa.":[83],"substantially":[85],"extend":[86],"protocol-implies-code":[88],"direction:":[89],"any":[90],"computing":[92],"with":[95,115],"large":[97],"fooling":[98,117],"set":[99,118],"converted":[102],"into":[103],"an":[104],"code.":[106],"As":[107],"corollary,":[109],"among":[113],"functions":[114],"size":[120],"s,":[121],"on":[123,137,165],"log":[124],"s":[125],"bits":[126],"has":[127],"least":[129],"complexity,":[132],"regardless":[133],"restrictions":[136,164],"randomness.":[145,173],"Finally,":[146],"use":[148],"connection":[150],"analyze":[155],"varying":[163],"In":[174],"most":[175],"cases,":[176],"provide":[178],"tight":[179,187],"bounds.":[180],"pinpoint":[182],"setting":[184],"in":[185],"which":[186],"bounds":[188],"still":[190],"unknown.":[191]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-12-10T00:00:00"}