{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:58:52Z","timestamp":1743087532088,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_30","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"392-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Minimum Depth of\u00a0Circuits with\u00a0Linear Number of\u00a0Wires Encoding Good Codes"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Drucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8979-1299","authenticated-orcid":false,"given":"Yuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inform. Theory 46(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0022-0000(05)80027-3","volume":"48","author":"N Alon","year":"1994","unstructured":"Alon, N., Pudl\u00e1k, P.: Superconcentrators of depths 2 and 3; odd levels help (rarely). J. Comput. Syst. Sci. 48(1), 194\u2013202 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"30_CR3","doi-asserted-by":"publisher","first-page":"2103","DOI":"10.1109\/TIT.2005.847727","volume":"51","author":"LMJ Bazzi","year":"2005","unstructured":"Bazzi, L.M.J., Mitter, S.K.: Endcoding complexity versus minimum distance. IEEE Trans. Inform. Theory 51(6), 2103\u20132112 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Beck, C., Impagliazzo, R., Lovett, S.: Large deviation bounds for decision trees and sampling lower bounds for AC0 circuits. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). pp. 101\u2013110. IEEE (2012)","DOI":"10.1109\/FOCS.2012.82"},{"issue":"5","key":"30_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0020-0190(97)00131-2","volume":"63","author":"RB Boppana","year":"1997","unstructured":"Boppana, R.B.: The average sensitivity of bounded-depth circuits. Inform. Process. Lett. 63(5), 257\u2013261 (1997)","journal-title":"Inform. Process. Lett."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Chen, L., Tell, R.: Bootstrapping results for threshold circuits \u201cjust beyond\" known lower bounds. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 34\u201341 (2019)","DOI":"10.1145\/3313276.3316333"},{"issue":"5","key":"30_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2528404","volume":"60","author":"HY Cheung","year":"2013","unstructured":"Cheung, H.Y., Kwok, T.C., Lau, L.C.: Fast matrix rank algorithms and applications. J. ACM (JACM) 60(5), 1\u201325 (2013)","journal-title":"J. ACM (JACM)"},{"key":"30_CR8","unstructured":"Dobrushin, R.L., Gelfand, S.I., Pinsker, M.S.: On complexity of coding. In: Proceedings of 2nd International Symposium on Information Theory, pp. 174\u2013184 (1973)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Pippenger, N., Wigderson, A.: Superconcentrators, generalizers and generalized connectors with limited depth. In: Johnson, D.S., et al. (eds.) Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25\u201327 April 1983, Boston, Massachusetts, USA, pp. 42\u201351. ACM (1983)","DOI":"10.1145\/800061.808731"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Druk, E., Ishai, Y.: Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, pp. 169\u2013182 (2014)","DOI":"10.1145\/2554797.2554815"},{"issue":"10","key":"30_CR11","doi-asserted-by":"publisher","first-page":"6611","DOI":"10.1109\/TIT.2013.2270275","volume":"59","author":"A Gal","year":"2013","unstructured":"Gal, A., Hansen, K.A., Koucky, M., Pudlak, P., Viola, E.: Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. IEEE Trans. Inform. Theory 59(10), 6611\u20136627 (2013)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"30_CR12","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., SWahby, R.: Brakedown: linear-time and post-quantum SNARKs for R1CS. Cryptology ePrint Archive (2021)"},{"key":"30_CR13","unstructured":"Guruswami, V., Rudra, A., Sudan, M.: Essential coding theory. http:\/\/www.cse.buffalo.edu\/atri\/courses\/coding-theory\/book2.1 (2012)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: Proceedings of the Fortieth Annual ACM symposium on Theory of Computing, pp. 433\u2013442 (2008)","DOI":"10.1145\/1374376.1374438"},{"issue":"2","key":"30_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"SYR Li","year":"2003","unstructured":"Li, S.Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Trans. Inform. Theory 49(2), 371\u2013381 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"30_CR16","unstructured":"Li, Y.: Some Results in Low-Depth Circuit Complexity. The University of Chicago (2017)"},{"key":"30_CR17","unstructured":"Li, Y.: Secret Sharing on Superconcentrator. arXiv preprint arXiv:2302.04482 (2023)"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Ling, S., Xing, C.: Coding theory: a first course. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511755279"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Lovett, S.: MDS matrices over small fields: a proof of the GM-MDS conjecture. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 194\u2013199. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00027"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Lovett, S., Viola, E.: Bounded-depth circuits cannot sample good codes. In: 2011 IEEE 26th Annual Conference on Computational Complexity (CCC), pp. 243\u2013251. IEEE (2011)","DOI":"10.1109\/CCC.2011.11"},{"issue":"2","key":"30_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01215351","volume":"14","author":"P Pudlak","year":"1994","unstructured":"Pudlak, P.: Communication in bounded depth circuits. Combinatorica 14(2), 203\u2013216 (1994)","journal-title":"Combinatorica"},{"issue":"2","key":"30_CR22","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/S009753970138462X","volume":"32","author":"R Raz","year":"2003","unstructured":"Raz, R., Shpilka, A.: Lower bounds for matrix product in bounded depth circuits with arbitrary gates. SIAM J. Comput. 32(2), 488\u2013513 (2003)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"30_CR23","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M Sipser","year":"1996","unstructured":"Sipser, M., Spielman, D.A.: Expander codes. IEEE Trans. Inform. Theory 42(6), 1710\u20131722 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"30_CR24","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"DA Spielman","year":"1996","unstructured":"Spielman, D.A.: Linear-time encodable and decodable errorcorrecting codes. IEEE Trans. Inform. Theory 42(6), 1723\u20131731 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"30_CR25","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM (JACM) 22(2), 215\u2013225 (1975)","journal-title":"J. ACM (JACM)"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: On non-linear lower bounds in computational complexity. In: Proceedings of the Seventh Annual ACM Symposium on Theory of Computing, pp. 45\u201353 (1975)","DOI":"10.1145\/800116.803752"},{"issue":"3","key":"30_CR27","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/S0022-0000(76)80041-4","volume":"13","author":"LG Valiant","year":"1976","unstructured":"Valiant, L.G.: Graph-theoretic properties in computational complexity. J. Comput. Syst. Sci. 13(3), 278\u2013285 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Graph-theoretic arguments in low-level complexity. In: 6th Symposium on Mathematical Foundations of Computer Science 1977, Tatranska Lomnica, Czechoslovakia, 5\u20139 September 1977, Proceedings, pp. 162\u2013176 (1977)","DOI":"10.1007\/3-540-08353-7_135"},{"issue":"1","key":"30_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2019.v015a018","volume":"15","author":"E Viola","year":"2019","unstructured":"Viola, E.: Lower bounds for data structures with space close to maximum imply circuit lower bounds\". Theory Comput. 15(1), 1\u20139 (2019)","journal-title":"Theory Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:07:38Z","timestamp":1702026458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}