{"id":"https://openalex.org/W1984184793","doi":"https://doi.org/10.1109/tit.2013.2270275","title":"Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates","display_name":"Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates","publication_year":2013,"publication_date":"2013-09-11","ids":{"openalex":"https://openalex.org/W1984184793","doi":"https://doi.org/10.1109/tit.2013.2270275","mag":"1984184793"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2013.2270275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2270275","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078455094","display_name":"Anna G\u00e1l","orcid":"https://orcid.org/0000-0001-9772-3966"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anna Gal","raw_affiliation_strings":["Department of Computer Science, University of Texas, Austin, Austin, TX, USA","Department of Computer Science, University of Texas at Austin, Austin, TX, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Department of Computer Science, University of Texas at Austin, Austin, TX, USA#TAB#","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055834958","display_name":"Kristoffer Arnsfelt Hansen","orcid":"https://orcid.org/0000-0002-1155-8072"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kristoffer Arnsfelt Hansen","raw_affiliation_strings":["Department of Computer Science, Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040922782","display_name":"Michal Kouck\u00fd","orcid":"https://orcid.org/0000-0003-0808-2269"},"institutions":[{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Michal Koucky","raw_affiliation_strings":["Institute of Mathematics, Academy of Sciences, Prague, Czech Republic","Inst. of Math., Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Academy of Sciences, Prague, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]},{"raw_affiliation_string":"Inst. of Math., Prague, Czech Republic","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109848440","display_name":"Pavel Pudl\u00e1k","orcid":null},"institutions":[{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Pudlak","raw_affiliation_strings":["Institute of Mathematics, Academy of Sciences, Prague, Czech Republic","Inst. of Math., Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Academy of Sciences, Prague, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]},{"raw_affiliation_string":"Inst. of Math., Prague, Czech Republic","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072846764","display_name":"Emanuele Viola","orcid":"https://orcid.org/0000-0001-6091-1824"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emanuele Viola","raw_affiliation_strings":["College of Computer and Information Science, Northeastern University, Boston, MA, USA","College of Computer and Information Science, Northeastern University , Boston, MA , USA"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information Science, Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"College of Computer and Information Science, Northeastern University , Boston, MA , USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5078455094"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.596,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.6775228,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"59","issue":"10","first_page":"6611","last_page":"6627"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9993000030517578,"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/T10237","display_name":"Cryptography and Data Security","score":0.998199999332428,"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/bounded-function","display_name":"Bounded function","score":0.70777428150177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5714781880378723},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5140796899795532},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38618096709251404},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35754847526550293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34094494581222534},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33676183223724365}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.70777428150177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5714781880378723},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5140796899795532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38618096709251404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35754847526550293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34094494581222534},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33676183223724365},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tit.2013.2270275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2270275","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.726.7558","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.726.7558","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.au.dk/%7Earnsfelt/Papers/ecc-circuits.pdf","raw_type":"text"},{"id":"pmh:oai:asep.lib.cas.cz:CavUnEpca/0422134","is_oa":false,"landing_page_url":"http://hdl.handle.net/11104/0228346","pdf_url":null,"source":{"id":"https://openalex.org/S7407055266","display_name":"ASEP","issn_l":null,"issn":null,"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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/1ea71716-d939-405d-8294-f0f749d2cf1b","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/report/2011/150/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.atira.dk:publications/3e821006-d439-4be0-890d-e8d932e89385","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/3e821006-d439-4be0-890d-e8d932e89385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gal, A, Hansen, K A, Koucky, M, Pudlak, P & Viola, E 2013, 'Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates', I E E E Transactions on Information Theory, vol. 59, no. 10, pp. 6611-6627. https://doi.org/10.1109/TIT.2013.2270275","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1539074731","https://openalex.org/W1555946936","https://openalex.org/W1577741814","https://openalex.org/W1590864168","https://openalex.org/W1977292605","https://openalex.org/W1992906573","https://openalex.org/W2014482556","https://openalex.org/W2018047324","https://openalex.org/W2031713274","https://openalex.org/W2031934066","https://openalex.org/W2035532007","https://openalex.org/W2042194938","https://openalex.org/W2045064738","https://openalex.org/W2047342855","https://openalex.org/W2049815987","https://openalex.org/W2058264792","https://openalex.org/W2058859323","https://openalex.org/W2069788171","https://openalex.org/W2080295594","https://openalex.org/W2088559598","https://openalex.org/W2090190190","https://openalex.org/W2100661986","https://openalex.org/W2103897251","https://openalex.org/W2122270497","https://openalex.org/W2134490689","https://openalex.org/W2135393523","https://openalex.org/W2150212378","https://openalex.org/W2335996541","https://openalex.org/W2490907619","https://openalex.org/W3143506846","https://openalex.org/W6644303842","https://openalex.org/W6680864989"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W4409439182","https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W1992739770","https://openalex.org/W2053286651","https://openalex.org/W4386900933","https://openalex.org/W2181743346"],"abstract_inverted_index":{"We":[0],"bound":[1,224,230],"the":[2,146,162,177,226,253,285],"minimum":[3,27],"number":[4],"<formula":[5,20,29,42,57,65,78,86,97,104,113,121,130,138,147,164,179,188,196,205,213],"formulatype=\"inline\"":[6,21,30,43,58,66,79,87,98,105,114,122,131,139,148,165,180,189,197,206,214],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[7,22,31,44,59,67,80,88,99,106,115,123,132,140,149,166,181,190,198,207,215],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex":[8,23,32,45,60,81,100,116,124,141,167,182,191,208],"Notation=\"TeX\">$w$</tex></formula>":[9],"of":[10,40,255,287],"wires":[11],"needed":[12],"to":[13,160,169],"compute":[14],"any":[15,233],"(asymptotically":[16],"good)":[17],"error-correcting":[18],"code":[19,248],"Notation=\"TeX\">$C:\\{0,1\\}^{\\Omega":[24],"(n)}\\to\\{0,1\\}^{n}$</tex></formula>":[25],"with":[26,48],"distance":[28],"Notation=\"TeX\">$\\Omega":[33,218],"(n)$</tex></formula>":[34],",":[35,63,84,119,128,137,144,194,211],"using":[36],"unbounded":[37],"fan-in":[38],"circuits":[39,288],"depth":[41,204],"Notation=\"TeX\">$d$</tex>":[46],"</formula>":[47,62,83,102,127,143,193,210],"arbitrary":[49],"gates.":[50],"Our":[51,275],"main":[52],"results":[53],"are:":[54],"1)":[55],"if":[56,77,96,187],"Notation=\"TeX\">$d=2$</tex>":[61,209],"then":[64,85,120,195],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[68,89,107,133,150,199,216],"<tex":[69,90,108,134,151,200,217],"Notation=\"TeX\">$w=\\Theta":[70,91,125],"(n":[71,219],"({\\lg":[72,220],"n/\\lg\\lg":[73,221],"n})^{2})$</tex></formula>":[74,222],";":[75,94,184],"2)":[76],"Notation=\"TeX\">$d=3$</tex>":[82],"(n\\lg\\lg":[92],"n)$</tex></formula>":[93],"3)":[95],"Notation=\"TeX\">$d=2k$</tex>":[101],"or":[103],"Notation=\"TeX\">$d=2k+1$</tex></formula>":[109],"for":[110,231,246,270],"some":[111],"integer":[112],"Notation=\"TeX\">$k\\geq":[117],"2$</tex></formula>":[118],"(n\\lambda_{k}(n))$</tex>":[126],"where":[129],"Notation=\"TeX\">$\\lambda_{1}(n)=\\lceil\\lg":[135],"n\\rceil$</tex></formula>":[136],"Notation=\"TeX\">$\\lambda_{i+1}(n)=\\lambda_{i}^{\\ast}(n)$</tex>":[142],"and":[145,185,301],"Notation=\"TeX\">$\\ast$</tex></formula>":[152],"operation":[153],"gives":[154,225],"how":[155],"many":[156],"times":[157],"one":[158],"has":[159],"iterate":[161],"function":[163],"Notation=\"TeX\">$\\lambda_{i}$</tex></formula>":[168],"reach":[170],"a":[171,241,281],"value":[172],"at":[173],"most":[174],"1":[175],"from":[176],"argument":[178],"Notation=\"TeX\">$n$</tex></formula>":[183],"4)":[186],"Notation=\"TeX\">$d=\\lg^{\\ast}n$</tex>":[192],"Notation=\"TeX\">$w=O(n)$</tex></formula>":[201],".":[202],"For":[203],"our":[212,247],"lower":[223,229,276],"largest":[227],"known":[228,260],"computing":[232,271,289],"linear":[234],"map.":[235],"The":[236],"upper":[237],"bounds":[238,269,277],"imply":[239],"that":[240,284],"(necessarily":[242],"dense)":[243],"generator":[244],"matrix":[245],"can":[249],"be":[250],"written":[251],"as":[252],"product":[254],"two":[256],"sparse":[257],"matrices.":[258],"Using":[259],"techniques,":[261],"we":[262],"also":[263],"obtain":[264],"similar":[265],"(but":[266],"not":[267],"tight)":[268],"pairwise-independent":[272],"hash":[273],"functions.":[274],"are":[278],"based":[279],"on":[280],"superconcentrator-like":[282],"condition":[283,295],"graphs":[286],"good":[290],"codes":[291],"must":[292],"satisfy.":[293],"This":[294],"is":[296],"provably":[297],"intermediate":[298],"between":[299],"superconcentrators":[300],"their":[302],"weakenings":[303],"considered":[304],"before.":[305]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}