{"id":"https://openalex.org/W319498177","doi":"https://doi.org/10.1145/1993636.1993660","title":"High-rate codes with sublinear-time decoding","display_name":"High-rate codes with sublinear-time decoding","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W319498177","doi":"https://doi.org/10.1145/1993636.1993660","mag":"319498177"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993660","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993660","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993660","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993660","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031695135","display_name":"Swastik Kopparty","orcid":"https://orcid.org/0000-0003-2704-8808"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Swastik Kopparty","raw_affiliation_strings":["Institute for Advanced Study, Princeton, NJ, USA","Institute for Advanced Study"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]},{"raw_affiliation_string":"Institute for Advanced Study","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020540233","display_name":"Shubhangi Saraf","orcid":"https://orcid.org/0009-0005-0874-2978"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shubhangi Saraf","raw_affiliation_strings":["MIT, Cambridge, MA, USA","Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046685409","display_name":"Sergey Yekhanin","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210086253","display_name":"Silicon Valley Community Foundation","ror":"https://ror.org/001ader08","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210086253"]},{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN","US"],"is_corresponding":false,"raw_author_name":"Sergey Yekhanin","raw_affiliation_strings":["Microsoft Research Silicon Valley, Mountain View, CA, USA","Microsoft Research, Silicon, Valley"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Silicon Valley, Mountain View, CA, USA","institution_ids":["https://openalex.org/I4210086253","https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, Silicon, Valley","institution_ids":["https://openalex.org/I4210124949"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5031695135"],"corresponding_institution_ids":["https://openalex.org/I40036882"],"apc_list":null,"apc_paid":null,"fwci":0.877,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78691801,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"61","issue":"5","first_page":"1","last_page":"176"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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/T11130","display_name":"Coding theory and cryptography","score":1.0,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9995999932289124,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9986000061035156,"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/locality","display_name":"Locality","score":0.6564892530441284},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6545215249061584},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5290504693984985},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5289297699928284},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5247951745986938},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.5198774337768555},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4821574091911316},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47606274485588074},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.45655766129493713},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4407120645046234},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4122902750968933},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.40093329548835754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37697046995162964},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3527875542640686},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.07196405529975891}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6564892530441284},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6545215249061584},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5290504693984985},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5289297699928284},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5247951745986938},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.5198774337768555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4821574091911316},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47606274485588074},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.45655766129493713},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4407120645046234},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4122902750968933},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.40093329548835754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37697046995162964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3527875542640686},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.07196405529975891},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1993636.1993660","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993660","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993660","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"doi:10.1145/2629416","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629416","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"mag:319498177","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc17.html#KoppartySY10","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1145/1993636.1993660","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993660","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993660","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G630445715","display_name":null,"funder_award_id":"DMS-0835373","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6651341434","display_name":"CDI Type II:  Pseudorandomness","funder_award_id":"0835373","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W319498177.pdf","grobid_xml":"https://content.openalex.org/works/W319498177.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W8086037","https://openalex.org/W182224116","https://openalex.org/W1555149635","https://openalex.org/W1608486273","https://openalex.org/W1617915743","https://openalex.org/W1707592146","https://openalex.org/W1901622511","https://openalex.org/W1967703498","https://openalex.org/W1998698985","https://openalex.org/W2000211775","https://openalex.org/W2019578639","https://openalex.org/W2021736779","https://openalex.org/W2032431003","https://openalex.org/W2048651540","https://openalex.org/W2053086236","https://openalex.org/W2061394882","https://openalex.org/W2063130531","https://openalex.org/W2063994293","https://openalex.org/W2074064997","https://openalex.org/W2082647621","https://openalex.org/W2088336724","https://openalex.org/W2102801247","https://openalex.org/W2107342895","https://openalex.org/W2109782186","https://openalex.org/W2111393415","https://openalex.org/W2120282110","https://openalex.org/W2121417875","https://openalex.org/W2126216220","https://openalex.org/W2132937716","https://openalex.org/W2133589924","https://openalex.org/W2135453633","https://openalex.org/W2146078064","https://openalex.org/W2148352980","https://openalex.org/W2154522281","https://openalex.org/W2170389905","https://openalex.org/W2293988196","https://openalex.org/W2610313478","https://openalex.org/W2963096774","https://openalex.org/W2998808137","https://openalex.org/W3103511209","https://openalex.org/W3109276270","https://openalex.org/W3145604423","https://openalex.org/W4230909286","https://openalex.org/W4256317935","https://openalex.org/W6650825486","https://openalex.org/W6966779599"],"related_works":["https://openalex.org/W2323040826","https://openalex.org/W2151937123","https://openalex.org/W2001766583","https://openalex.org/W2167592273","https://openalex.org/W2800805056","https://openalex.org/W2004059212","https://openalex.org/W2790601937","https://openalex.org/W3159135841","https://openalex.org/W1574417069","https://openalex.org/W2033546746","https://openalex.org/W2963014435","https://openalex.org/W2071675087","https://openalex.org/W2166871058","https://openalex.org/W2269533575","https://openalex.org/W3196432795","https://openalex.org/W3207459428","https://openalex.org/W2929437377","https://openalex.org/W2022069541","https://openalex.org/W2999217642","https://openalex.org/W1553445689"],"abstract_inverted_index":{"Locally":[0],"decodable":[1,135,190],"codes":[2,5,78,97,114,136,222],"are":[3,212],"error-correcting":[4],"that":[6,58,137,155],"admit":[7],"efficient":[8,140],"decoding":[9,46,85,142],"algorithms;":[10],"any":[11],"bit":[12],"of":[13,27,29,38,44,66,72,79,98,109,115,133,178,195,232],"the":[14,36,42,64,107,110,146,230,237,246],"original":[15],"message":[16],"can":[17],"be":[18],"recovered":[19],"by":[20],"looking":[21],"at":[22,63,145,236],"only":[23,95],"a":[24,30,39,130,172,192],"small":[25],"number":[26],"locations":[28],"corrupted":[31],"codeword.":[32],"The":[33],"tradeoff":[34],"between":[35],"rate":[37,99,116,150,182,247],"code":[40,173],"and":[41,52,144,161,187,203,218,235,243,248],"locality/efficiency":[43],"its":[45],"algorithms":[47,86],"has":[48,54],"been":[49,56,123],"well":[50],"studied,":[51],"it":[53],"widely":[55],"suspected":[57],"nontrivial":[59,120],"locality":[60,88,121],"must":[61],"come":[62],"price":[65],"low":[67],"rate.":[68,81],"A":[69],"particular":[70],"setting":[71],"potential":[73],"interest":[74],"in":[75,245],"practice":[76],"is":[77,106,188],"constant":[80,193],"For":[82],"such":[83],"codes,":[84,206,211,234],"with":[87,181],"O":[89,198],"(":[90,199],"k\u2208":[91,200],")":[92,201],"were":[93],"known":[94],"for":[96,113,156,165],"\u2208":[100,102,158],"\u03a9(1/":[101],"),":[103],"where":[104],"k":[105,168,180],"length":[108,179],"message.":[111],"Furthermore,":[112],">":[117,159,163],"1/2,":[118],"no":[119],"had":[122],"achieved.":[124],"In":[125],"this":[126],"article,":[127],"we":[128,208],"construct":[129],"new":[131],"family":[132],"locally":[134,189],"have":[138,149],"very":[139],"local":[141],"algorithms,":[143],"same":[147,238],"time":[148,239],"approaching":[151],"1.":[152],"We":[153],"show":[154],"every":[157],"0":[160],"\u03b1":[162,185],"0,":[164],"infinitely":[166],"many":[167],",":[169,186],"there":[170],"exists":[171],"C":[174],"which":[175,207],"encodes":[176],"messages":[177],"1":[183],"\u2212":[184],"from":[191],"fraction":[194],"errors":[196],"using":[197],"queries":[202],"time.":[204],"These":[205],"call":[209],"multiplicity":[210],"based":[213],"on":[214],"evaluating":[215],"multivariate":[216,225],"polynomials":[217],"their":[219],"derivatives.":[220],"Multiplicity":[221],"extend":[223],"traditional":[224],"polynomial":[226],"codes;":[227],"they":[228],"inherit":[229],"local-decodability":[231],"these":[233],"achieve":[240],"better":[241],"tradeoffs":[242],"flexibility":[244],"minimum":[249],"distance.":[250]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}