{"id":"https://openalex.org/W2122058331","doi":"https://doi.org/10.4086/toc.2012.v008a008","title":"","display_name":"","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2122058331","doi":"https://doi.org/10.4086/toc.2012.v008a008","mag":"2122058331"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2012.v008a008","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2012.v008a008","pdf_url":"https://theoryofcomputing.org/articles/v008a008/v008a008.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v008a008/v008a008.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079755716","display_name":"Alexander A. Sherstov","orcid":"https://orcid.org/0000-0002-2488-7852"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander A. Sherstov","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079755716"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2428,"has_fulltext":true,"cited_by_count":75,"citation_normalized_percentile":{"value":0.9594561,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"8","issue":"1","first_page":"197","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998000264167786,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7357324957847595},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6882368326187134},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6833206415176392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6828633546829224},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5557552576065063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48233720660209656},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4802665710449219},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4577357769012451},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.4296102523803711},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.14252641797065735},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.12692999839782715},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.08916658163070679},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.06972947716712952},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.06790846586227417}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7357324957847595},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6882368326187134},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6833206415176392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6828633546829224},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5557552576065063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48233720660209656},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4802665710449219},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4577357769012451},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.4296102523803711},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.14252641797065735},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.12692999839782715},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.08916658163070679},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.06972947716712952},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.06790846586227417},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2012.v008a008","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2012.v008a008","pdf_url":"https://theoryofcomputing.org/articles/v008a008/v008a008.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2012.v008a008","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2012.v008a008","pdf_url":"https://theoryofcomputing.org/articles/v008a008/v008a008.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2629604219","display_name":null,"funder_award_id":"CCF-1149018","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3041994311","display_name":null,"funder_award_id":"14901","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3658206218","display_name":"CAREER: Limits of Communication","funder_award_id":"1149018","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","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":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2122058331.pdf","grobid_xml":"https://content.openalex.org/works/W2122058331.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W264700177","https://openalex.org/W605043455","https://openalex.org/W1972068724","https://openalex.org/W1973286131","https://openalex.org/W1980223785","https://openalex.org/W1984126159","https://openalex.org/W1991730713","https://openalex.org/W2006787007","https://openalex.org/W2068871408","https://openalex.org/W2070486524","https://openalex.org/W2104635635","https://openalex.org/W2107933515","https://openalex.org/W2120210041","https://openalex.org/W2129719258","https://openalex.org/W2131709403","https://openalex.org/W2132822431","https://openalex.org/W2160681854","https://openalex.org/W2162317237","https://openalex.org/W2170168647","https://openalex.org/W2340787257","https://openalex.org/W2405220055","https://openalex.org/W2977322974"],"related_works":["https://openalex.org/W2943247777","https://openalex.org/W2740543340","https://openalex.org/W2371167013","https://openalex.org/W1582340598","https://openalex.org/W1541021634","https://openalex.org/W2779867339","https://openalex.org/W2794545997","https://openalex.org/W2584980534","https://openalex.org/W2182731056","https://openalex.org/W66917582"],"abstract_inverted_index":{"In":[0,34,58],"the":[1,45,51],"gap":[2],"Hamming":[3,21],"distance":[4,22],"problem,":[5],"two":[6],"parties":[7],"must":[8],"determine":[9],"whether":[10],"their":[11],"respective":[12],"strings":[13],"x,":[14],"y":[15],"{0,":[16],"1}":[17],"n":[18,27],"are":[19],"at":[20],"less":[23],"than":[24,30],"n/2":[25,31],"-":[26],"or":[28],"greater":[29],"+":[32],"n.":[33],"a":[35,64,69,77],"recent":[36],"tour":[37],"de":[38],"force,":[39],"Chakrabarti":[40],"and":[41,76],"Regev":[42],"(2010)":[43,62],"proved":[44],"longconjectured":[46],"(n)":[47],"lower":[48],"bound":[49],"on":[50],"randomized":[52],"communication":[53],"complexity":[54],"of":[55],"this":[56],"problem.":[57],"follow-up":[59],"work,":[60],"Vidick":[61],"discovered":[63],"simpler":[65,74],"proof.":[66],"We":[67],"contribute":[68],"new":[70],"proof,":[71],"which":[72],"is":[73],"yet":[75],"page-and-a-half":[78],"long.":[79]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}