{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:40:13Z","timestamp":1702028413843},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/tit.2013.2270275","type":"journal-article","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T19:27:38Z","timestamp":1378927658000},"page":"6611-6627","source":"Crossref","is-referenced-by-count":7,"title":["Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates"],"prefix":"10.1109","volume":"59","author":[{"given":"Anna","family":"Gal","sequence":"first","affiliation":[]},{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Koucky","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Pudlak","sequence":"additional","affiliation":[]},{"given":"Emanuele","family":"Viola","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0187-1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/800116.803752"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.556668"},{"key":"ref30","author":"spielman","year":"1995","journal-title":"Computationally efficient error-correcting codes and holographic proofs"},{"key":"ref34","author":"welsh","year":"1976","journal-title":"Matroid Theory"},{"key":"ref10","first-page":"396","article-title":"The bit extraction problem or <formula formulatype=\"inline\"><tex Notation=\"TeX\">$t$<\/tex><\/formula>-resilient functions","author":"chor","year":"1985","journal-title":"Proc 26th Annu IEEE Symp Found Comput Sci"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808731"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_30"},{"key":"ref13","author":"ford","year":"1962","journal-title":"Flows in Networks"},{"key":"ref14","first-page":"177","article-title":"On the complexity of coding","author":"gelfand","year":"1973","journal-title":"Proc Int Symp Inf Theory"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1109\/SFCS.2001.959942","article-title":"Expander-based constructions of efficiently decodable codes","author":"guruswami","year":"2001","journal-title":"Proc 42nd Annu IEEE Symp Found Comput Sci"},{"key":"ref16","first-page":"6037","article-title":"Nombre minimal de contacts de fermature n\ufffdcessaires pour r\ufffdaliser une fonction bool\ufffdenne sym\ufffdtrique de <formula formulatype=\"inline\"><tex Notation=\"TeX\">$n$<\/tex> <\/formula> variables","volume":"258","author":"hansel","year":"1964","journal-title":"C R Acad Sci Paris"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374438"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24508-4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00115-Y"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/TIT.2008.2008114","article-title":"The minimum distance of turbo-like codes","volume":"55","author":"bazzi","year":"2009","journal-title":"IEEE Trans Inf Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215351"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80027-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00131-2"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480197329508"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847727"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0036901"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702405292"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.119713"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90015-7"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28410"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/210118.210136"},{"key":"ref22","first-page":"243","article-title":"Bounded-depth circuits cannot sample good codes","author":"lovett","year":"2010","journal-title":"Proc 25th Annu IEEE Conf Comput Complex"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174138"},{"key":"ref24","first-page":"556","article-title":"Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries","author":"miltersen","year":"1998","journal-title":"Proc 9th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90257-T"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(68)90163-7"},{"key":"ref25","author":"oxley","year":"1992","journal-title":"Matroid Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6595627\/06578188.pdf?arnumber=6578188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:50Z","timestamp":1638218870000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6578188\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":34,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2270275","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10]]}}}