{"id":"https://openalex.org/W2055635427","doi":"https://doi.org/10.1137/090779875","title":"Locally Testable Codes Require Redundant Testers","display_name":"Locally Testable Codes Require Redundant Testers","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2055635427","doi":"https://doi.org/10.1137/090779875","mag":"2055635427"},"language":"en","primary_location":{"id":"doi:10.1137/090779875","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090779875","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5058111762","display_name":"Eli Ben\u2010Sasson","orcid":"https://orcid.org/0000-0002-0708-0483"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eli Ben-Sasson","raw_affiliation_strings":["eli@cs.technion.ac.il and viderman@cs.technion.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"eli@cs.technion.ac.il and viderman@cs.technion.ac.il#TAB#","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["guruswami@cmu.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"guruswami@cmu.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109110331","display_name":"Tali Kaufman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tali Kaufman","raw_affiliation_strings":["tali.kaufman@weizmann.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"tali.kaufman@weizmann.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Madhu Sudan","raw_affiliation_strings":["madhu@microsoft.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"madhu@microsoft.com#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007701626","display_name":"Michael Viderman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Viderman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0919,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.91303383,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"39","issue":"7","first_page":"3230","last_page":"3247"},"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.9998000264167786,"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.9998000264167786,"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.9991000294685364,"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/T12029","display_name":"DNA and Biological Computing","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7222381830215454},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5746080875396729},{"id":"https://openalex.org/keywords/dual-polyhedron","display_name":"Dual polyhedron","score":0.5680739879608154},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5145711302757263},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.49377259612083435},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.48858770728111267},{"id":"https://openalex.org/keywords/dual-code","display_name":"Dual code","score":0.4696356952190399},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4452466070652008},{"id":"https://openalex.org/keywords/property-testing","display_name":"Property testing","score":0.43633753061294556},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4103674292564392},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4047073423862457},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2967211604118347},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.29587167501449585},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2718364894390106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.225468248128891},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.10343065857887268}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7222381830215454},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5746080875396729},{"id":"https://openalex.org/C105313907","wikidata":"https://www.wikidata.org/wiki/Q1053857","display_name":"Dual polyhedron","level":2,"score":0.5680739879608154},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5145711302757263},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.49377259612083435},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.48858770728111267},{"id":"https://openalex.org/C73666251","wikidata":"https://www.wikidata.org/wiki/Q5310189","display_name":"Dual code","level":5,"score":0.4696356952190399},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4452466070652008},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.43633753061294556},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4103674292564392},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4047073423862457},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2967211604118347},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.29587167501449585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2718364894390106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.225468248128891},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.10343065857887268},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/090779875","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090779875","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2022381972","https://openalex.org/W2038691311","https://openalex.org/W2051880745","https://openalex.org/W2057157452","https://openalex.org/W2111385661","https://openalex.org/W2131486878","https://openalex.org/W2138475026"],"related_works":["https://openalex.org/W3105618276","https://openalex.org/W60780125","https://openalex.org/W2771127828","https://openalex.org/W1667411252","https://openalex.org/W2891567330","https://openalex.org/W1579051351","https://openalex.org/W2111330432","https://openalex.org/W2383670054","https://openalex.org/W4287777542","https://openalex.org/W2772956856"],"abstract_inverted_index":{"Locally":[0],"testable":[1],"codes":[2,6,34,38,240],"(LTCs)":[3],"are":[4,32,293,305],"error-correcting":[5,37],"for":[7,62,194,206,257],"which":[8,230],"membership,":[9],"in":[10,23,98,130,165,295],"the":[11,55,67,95,106,136,140,154,163,215,251,258,282],"code,":[12],"of":[13,30,54,110,149,157,184,214,218,261,266,268,274,285,309,313],"a":[14,146,181,185,306,310],"given":[15],"word":[16],"can":[17,203],"be":[18,52,84,204],"tested":[19],"by":[20,113],"examining":[21],"it":[22,74],"very":[24,277],"few":[25,278],"locations.":[26],"Most":[27],"known":[28,79],"constructions":[29],"LTCs":[31,81],"linear":[33,92,147,197,242,307],"and":[35,221],"give":[36,105],"whose":[39],"duals":[40],"have":[41,90,124,298],"(superlinearly)":[42],"many":[43,126,289],"small":[44,269,299],"weight":[45],"codewords.":[46],"Examining":[47],"this":[48,102,111],"feature":[49],"appears":[50],"to":[51,58,83,89,161,191,208],"one":[53,91],"promising":[56],"approaches":[57],"proving":[59],"limitation":[60],"results":[61],"(i.e.,":[63],"upper":[64],"bounds":[65],"on":[66],"rate":[68,118],"of)":[69],"LTCs.":[70],"Unfortunately,":[71],"until":[72],"now":[73],"has":[75,276],"not":[76,294],"even":[77],"been":[78],"whether":[80],"need":[82,88],"nontrivially":[85],"redundant,":[86],"i.e.,":[87,271],"dependency":[93],"among":[94],"low-weight":[96,128],"codewords":[97,129,152],"their":[99],"dual.":[100,132],"In":[101],"paper":[103],"we":[104],"first":[107],"lower":[108],"bound":[109],"form,":[112],"showing":[114],"that":[115,139,189,232,263,291],"every":[116,272],"positive":[117],"constant":[119,311],"query":[120,243],"strong":[121],"LTC":[122,198],"must":[123,144,287],"linearly":[125],"redundant":[127,150],"its":[131],"We":[133],"actually":[134],"prove":[135],"stronger":[137],"claim":[138],"actual":[141],"test":[142],"itself":[143],"use":[145],"number":[148,156],"dual":[151,259,283],"(beyond":[153],"minimum":[155],"basis":[158,255],"elements":[159],"required":[160],"characterize":[162],"code);":[164],"other":[166],"words,":[167],"nonredundant":[168],"(in":[169],"fact,":[170],"low":[171,235],"redundancy)":[172],"local":[173],"testing":[174,233],"is":[175,180,264],"impossible.":[176],"Our":[177],"main":[178,216],"theorem":[179,188,202,249],"special":[182],"case":[183],"more":[186,247],"general":[187,201,248],"applies":[190],"any":[192,254],"tester":[193],"an":[195,210],"arbitrary":[196],"$\\mathcal{C}$.":[199],"The":[200],"used,":[205],"instance,":[207],"provide":[209],"arguably":[211],"simpler":[212],"proof":[213],"result":[217],"Ben-Sasson,":[219],"Harsha,":[220],"Raskhodnikova":[222],"[SIAM":[223],"J.":[224],"Comput.,":[225],"35":[226],"(2005),":[227],"pp.":[228],"1\u201321],":[229],"says":[231,250],"random":[234],"density":[236],"parity":[237],"check":[238],"(LDPC)":[239],"requires":[241],"complexity.":[244],"Informally,":[245],"our":[246],"following.":[252],"Take":[253],"B":[256,275],"code":[260,284],"$\\mathcal{C}$":[262,286],"composed":[265],"words":[267,290],"support;":[270],"element":[273],"nonzero":[279],"entries.":[280],"Then":[281],"contain":[288],"(i)":[292],"B,":[296],"(ii)":[297],"support,":[300],"and,":[301],"most":[302],"importantly,":[303],"(iii)":[304],"combination":[308],"fraction":[312],"B.":[314]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}