{"id":"https://openalex.org/W2109284958","doi":"https://doi.org/10.1109/tit.2010.2070370","title":"Optimal Error Correction for Computationally Bounded Noise","display_name":"Optimal Error Correction for Computationally Bounded Noise","publication_year":2010,"publication_date":"2010-10-20","ids":{"openalex":"https://openalex.org/W2109284958","doi":"https://doi.org/10.1109/tit.2010.2070370","mag":"2109284958"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2010.2070370","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2070370","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/72605","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030198184","display_name":"Silvio Micali","orcid":null},"institutions":[{"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":true,"raw_author_name":"Silvio Micali","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086535374","display_name":"Chris Peikert","orcid":"https://orcid.org/0000-0003-0419-7501"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris Peikert","raw_affiliation_strings":["School of Computing, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489"},"institutions":[{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":null,"type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]},{"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/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madhu Sudan","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","Microsoft Research New England, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"Microsoft Research New England, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101845000","display_name":"David A. Wilson","orcid":"https://orcid.org/0000-0001-6031-9070"},"institutions":[{"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":"David A. Wilson","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5030198184"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.3982,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.85411938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"56","issue":"11","first_page":"5673","last_page":"5680"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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":0.9998000264167786,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9988999962806702,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7577600479125977},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7528941631317139},{"id":"https://openalex.org/keywords/communication-source","display_name":"Communication source","score":0.6863367557525635},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5462502837181091},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.49898314476013184},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4912804961204529},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.48839181661605835},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4709281325340271},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.44929707050323486},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4451422691345215},{"id":"https://openalex.org/keywords/information-theoretic-security","display_name":"Information-theoretic security","score":0.4342949390411377},{"id":"https://openalex.org/keywords/probability-of-error","display_name":"Probability of error","score":0.425700843334198},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.4173774719238281},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.41055524349212646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38652780652046204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36663272976875305},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.23360884189605713},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.12291377782821655},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10669457912445068},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08931830525398254}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7577600479125977},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7528941631317139},{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.6863367557525635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5462502837181091},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.49898314476013184},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4912804961204529},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.48839181661605835},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4709281325340271},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.44929707050323486},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4451422691345215},{"id":"https://openalex.org/C47191418","wikidata":"https://www.wikidata.org/wiki/Q3510462","display_name":"Information-theoretic security","level":3,"score":0.4342949390411377},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.425700843334198},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.4173774719238281},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.41055524349212646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38652780652046204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36663272976875305},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.23360884189605713},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.12291377782821655},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10669457912445068},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08931830525398254},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tit.2010.2070370","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2070370","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.174.7816","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.7816","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/madhu/papers/2005/mpsw-full.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.6547","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.6547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/silvio/Selected%20Scientific%20Papers/Information%20Theory/Optimal%20Error%20Correction%20for%20Computationally%20Bounded%20Noise.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/72605","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/72605","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"http://purl.org/eprint/type/JournalArticle"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/72605","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/72605","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"http://purl.org/eprint/type/JournalArticle"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1568318909","https://openalex.org/W1972129951","https://openalex.org/W1972792640","https://openalex.org/W1980073965","https://openalex.org/W1995875735","https://openalex.org/W2032431003","https://openalex.org/W2074594718","https://openalex.org/W2089272132","https://openalex.org/W2102300387","https://openalex.org/W2106215079","https://openalex.org/W2116231125","https://openalex.org/W2117142774","https://openalex.org/W2133589924","https://openalex.org/W2146078064","https://openalex.org/W2148575324","https://openalex.org/W2151413173","https://openalex.org/W2154198326","https://openalex.org/W2156186849","https://openalex.org/W2158541565","https://openalex.org/W2170716519","https://openalex.org/W2342204193","https://openalex.org/W6675225866","https://openalex.org/W6676144961"],"related_works":["https://openalex.org/W1553996060","https://openalex.org/W187355268","https://openalex.org/W2138116514","https://openalex.org/W2098326022","https://openalex.org/W2144468068","https://openalex.org/W2094867746","https://openalex.org/W3211079129","https://openalex.org/W3099663570","https://openalex.org/W150611415","https://openalex.org/W2963629492"],"abstract_inverted_index":{"For":[0,32,58],"adversarial":[1,96],"but":[2,95],"computationally":[3],"bounded":[4,94],"models":[5],"of":[6,102,112,117],"error,":[7],"we":[8,35,61,140,153,167],"construct":[9,36,62],"appealingly":[10],"simple":[11],"and":[12,16,151,181],"efficient":[13],"cryptographic":[14],"encoding":[15],"unique":[17],"decoding":[18],"schemes":[19,39,64],"whose":[20],"error-correction":[21],"capability":[22],"is":[23,119],"much":[24],"greater":[25],"than":[26,148],"classically":[27],"possible.":[28],"In":[29],"particular:":[30],"1)":[31,139],"binary":[33],"alphabets,":[34,60],"positive-rate":[37],"coding":[38,63],"that":[40,65,156],"are":[41,66,88],"uniquely":[42,67],"decodable":[43,68],"under":[44,69,131],"a":[45,70],"1/2":[46],"-":[47,72,126],"\u03b3":[48,54],"error":[49,74],"rate":[50,75,79],"for":[51,76,85],"any":[52,77,171],"constant":[53],">":[55,81],"0.":[56,82],"2)":[57,152],"large":[59,86],"1":[71,125],"R":[73,80],"information":[78,158],"Our":[83,128],"results":[84,129],"alphabets":[87],"actually":[89],"optimal,":[90],"since":[91],"the":[92,100,103,110,113,115,135,142,149,160],"\"computationally":[93],"channel\"":[97],"can":[98],"simulate":[99],"behavior":[101],"q-ary":[104],"symmetric":[105],"channel,":[106],"where":[107],"q":[108],"denotes":[109],"size":[111],"alphabet,":[114],"capacity":[116],"which":[118],"known":[120],"to":[121,144],"be":[122,145],"upper-bounded":[123],"by":[124],"R.":[127],"hold":[130],"minimal":[132],"assumptions":[133],"on":[134],"communication":[136],"infrastructure,":[137],"namely:":[138],"allow":[141],"channel":[143],"more":[146],"powerful":[147],"receiver":[150],"only":[154],"assume":[155],"some":[157],"about":[159],"sender-a":[161],"public":[162],"key-is":[163],"known.":[164],"(In":[165],"particular,":[166],"do":[168],"not":[169],"require":[170],"shared":[172],"secret":[173],"key":[174],"or":[175],"joint":[176],"local":[177],"state":[178],"between":[179],"sender":[180],"receivers).":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-05-15T08:27:34.491423","created_date":"2025-10-10T00:00:00"}