{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:53:55Z","timestamp":1781078035274,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,1,9]]},"DOI":"10.1145\/2422436.2422494","type":"proceedings-article","created":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T12:58:22Z","timestamp":1357217902000},"page":"529-540","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":62,"title":["New affine-invariant codes from lifting"],"prefix":"10.1145","author":[{"given":"Alan","family":"Guo","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Swastik","family":"Kopparty","sequence":"additional","affiliation":[{"name":"Rutgers University, Piscataway, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[{"name":"Microsoft Research New England, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856958"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"Arora Sanjeev","year":"2009","unstructured":"Sanjeev Arora and Boaz Barak . Computational Complexity: A Modern Approach . Cambridge , 2009 . Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach. Cambridge, 2009."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258642"},{"key":"e_1_3_2_1_5_1","volume-title":"Making the long code shorter, with applications to the unique games conjecture. CoRR, abs\/1111.0405","author":"Barak Boaz","year":"2011","unstructured":"Boaz Barak , Parikshit Gopalan , Johan H\u00e5stad , Raghu Meka , Prasad Raghavendra , and David Steurer . Making the long code shorter, with applications to the unique games conjecture. CoRR, abs\/1111.0405 , 2011 . Boaz Barak, Parikshit Gopalan, Johan H\u00e5stad, Raghu Meka, Prasad Raghavendra, and David Steurer. Making the long code shorter, with applications to the unique games conjecture. CoRR, abs\/1111.0405, 2011."},{"key":"e_1_3_2_1_6_1","volume-title":"On sums of locally testable affine invariant properties. Electronic Colloquium on Computational Complexity (ECCC), 18:79","author":"Ben-Sasson Eli","year":"2011","unstructured":"Eli Ben-Sasson , Elena Grigorescu , Ghid Maatouk , Amir Shpilka , and Madhu Sudan . On sums of locally testable affine invariant properties. Electronic Colloquium on Computational Complexity (ECCC), 18:79 , 2011 . Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, and Madhu Sudan. On sums of locally testable affine invariant properties. Electronic Colloquium on Computational Complexity (ECCC), 18:79, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.14"},{"key":"e_1_3_2_1_8_1","volume-title":"Sparse affine-invariant linear codes are locally testable. Electronic Colloquium on Computational Complexity (ECCC), 19:49","author":"Ben-Sasson Eli","year":"2012","unstructured":"Eli Ben-Sasson , Noga Ron-Zewi , and Madhu Sudan . Sparse affine-invariant linear codes are locally testable. Electronic Colloquium on Computational Complexity (ECCC), 19:49 , 2012 . Eli Ben-Sasson, Noga Ron-Zewi, and Madhu Sudan. Sparse affine-invariant linear codes are locally testable. Electronic Colloquium on Computational Complexity (ECCC), 19:49, 2012."},{"key":"e_1_3_2_1_9_1","volume-title":"Limits on the rate of locally testable affine-invariant codes. Electronic Colloquium on Computational Complexity (ECCC), 17:108","author":"Ben-Sasson Eli","year":"2010","unstructured":"Eli Ben-Sasson and Madhu Sudan . Limits on the rate of locally testable affine-invariant codes. Electronic Colloquium on Computational Complexity (ECCC), 17:108 , 2010 . Eli Ben-Sasson and Madhu Sudan. Limits on the rate of locally testable affine-invariant codes. Electronic Colloquium on Computational Complexity (ECCC), 17:108, 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.54"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90538-Q"},{"key":"e_1_3_2_1_12_1","volume-title":"On the size of Kakeya sets in finite fields. Journal of the American Mathematical Society, (to appear)","author":"Dvir Zeev","year":"2008","unstructured":"Zeev Dvir . On the size of Kakeya sets in finite fields. Journal of the American Mathematical Society, (to appear) , 2008 . Article electronically published on June 23, 2008. Zeev Dvir. On the size of Kakeya sets in finite fields. Journal of the American Mathematical Society, (to appear), 2008. Article electronically published on June 23, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.40"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0223-z"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/090748731"},{"issue":"1","key":"e_1_3_2_1_16_1","article-title":"Some inequalities in functional analysis, combinatorics, and probability theory","volume":"17","author":"Feng Chunrong","year":"2010","unstructured":"Chunrong Feng , Liangpan Li , and Jian Shen . Some inequalities in functional analysis, combinatorics, and probability theory . Electr. J. Comb. , 17 ( 1 ), 2010 . Chunrong Feng, Liangpan Li, and Jian Shen. Some inequalities in functional analysis, combinatorics, and probability theory. Electr. J. Comb., 17(1), 2010.","journal-title":"Electr. J. Comb."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/527073.881419"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103429"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90195-2"},{"key":"e_1_3_2_1_20_1","volume-title":"Proximity oblivious testing and the role of invariances. Electronic Colloquium on Computational Complexity (ECCC), 17:58","author":"Goldreich Oded","year":"2010","unstructured":"Oded Goldreich and Tali Kaufman . Proximity oblivious testing and the role of invariances. Electronic Colloquium on Computational Complexity (ECCC), 17:58 , 2010 . Oded Goldreich and Tali Kaufman. Proximity oblivious testing and the role of invariances. Electronic Colloquium on Computational Complexity (ECCC), 17:58, 2010."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.31"},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1007\/978-3-642-03685-9_40","volume-title":"Proceedings of RANDOM-APPROX","author":"Grigorescu Elena","year":"2009","unstructured":"Elena Grigorescu , Tali Kaufman , and Madhu Sudan . Succinct representation of codes with applications to testing . In Proceedings of RANDOM-APPROX 2009 , volume 5687 of Lecture Notes in Computer Science , pages 534 -- 547 . Springer , 2009. 10.1007\/978-3-642-03685-9_40 Elena Grigorescu, Tali Kaufman, and Madhu Sudan. Succinct representation of codes with applications to testing. In Proceedings of RANDOM-APPROX 2009, volume 5687 of Lecture Notes in Computer Science, pages 534--547. Springer, 2009. 10.1007\/978-3-642-03685-9_40"},{"key":"e_1_3_2_1_23_1","volume-title":"New affine-invariant codes from lifting. CoRR, abs\/1208.5413v2","author":"Guo Alan","year":"2012","unstructured":"Alan Guo , Swastik Kopparty , and Madhu Sudan . New affine-invariant codes from lifting. CoRR, abs\/1208.5413v2 , 2012 . Also appears as ECCC TR 12--149. Alan Guo, Swastik Kopparty, and Madhu Sudan. New affine-invariant codes from lifting. CoRR, abs\/1208.5413v2, 2012. Also appears as ECCC TR 12--149."},{"key":"e_1_3_2_1_24_1","volume-title":"Some closure features of locally testable affine-invariant properties. Electronic Colloquium on Computational Complexity (ECCC), 19:48","author":"Guo Alan","year":"2012","unstructured":"Alan Guo and Madhu Sudan . Some closure features of locally testable affine-invariant properties. Electronic Colloquium on Computational Complexity (ECCC), 19:48 , 2012 . Alan Guo and Madhu Sudan. Some closure features of locally testable affine-invariant properties. Electronic Colloquium on Computational Complexity (ECCC), 19:48, 2012."},{"key":"e_1_3_2_1_25_1","volume-title":"Manuscript","author":"Haramaty Elad","year":"2012","unstructured":"Elad Haramaty , Noga Ron-Zewi , and Madhu Sudan . Absolutely sound testing of lifted codes . Manuscript , November 2012 . Elad Haramaty, Noga Ron-Zewi, and Madhu Sudan. Absolutely sound testing of lifted codes. Manuscript, November 2012."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.61"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v35:2"},{"key":"e_1_3_2_1_28_1","volume-title":"Testing of exponentially large codes, by a new extension to weil bound for character sums. Electronic Colloquium on Computational Complexity (ECCC), 17:65","author":"Kaufman Tali","year":"2010","unstructured":"Tali Kaufman and Shachar Lovett . Testing of exponentially large codes, by a new extension to weil bound for character sums. Electronic Colloquium on Computational Complexity (ECCC), 17:65 , 2010 . Tali Kaufman and Shachar Lovett. Testing of exponentially large codes, by a new extension to weil bound for character sums. Electronic Colloquium on Computational Complexity (ECCC), 17:65, 2010."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214011"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704445615"},{"key":"e_1_3_2_1_31_1","volume-title":"Algebraic property testing: The role of invariance. Electronic Colloquium on Computational Complexity (ECCC), 14(111)","author":"Kaufman Tali","year":"2007","unstructured":"Tali Kaufman and Madhu Sudan . Algebraic property testing: The role of invariance. Electronic Colloquium on Computational Complexity (ECCC), 14(111) , 2007 . Tali Kaufman and Madhu Sudan. Algebraic property testing: The role of invariance. Electronic Colloquium on Computational Complexity (ECCC), 14(111), 2007."},{"key":"e_1_3_2_1_32_1","first-page":"406","volume-title":"Symmetric LDPC codes and local testing","author":"Kaufman Tali","year":"2010","unstructured":"Tali Kaufman and Avi Wigderson . Symmetric LDPC codes and local testing . In Andrew Chi-Chih Yao, editor, ICS, pages 406 -- 421 . Tsinghua University Press , 2010 . Tali Kaufman and Avi Wigderson. Symmetric LDPC codes and local testing. In Andrew Chi-Chih Yao, editor, ICS, pages 406--421. Tsinghua University Press, 2010."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993660"},{"key":"e_1_3_2_1_34_1","volume-title":"March","author":"Li Liangpan","year":"2008","unstructured":"Liangpan Li . On the size of Nikodym sets in finite fields. ArXiv e-prints , March 2008 . Liangpan Li. On the size of Nikodym sets in finite fields. ArXiv e-prints, March 2008."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255151"},{"key":"e_1_3_2_1_37_1","volume-title":"August","author":"Saraf Shubhangi","year":"2008","unstructured":"Shubhangi Saraf and Madhu Sudan . Improved lower bound on the size of Kakeya sets over finite fields. ArXiv e-prints , August 2008 . Shubhangi Saraf and Madhu Sudan. Improved lower bound on the size of Kakeya sets over finite fields. ArXiv e-prints, August 2008."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80046-3"},{"key":"e_1_3_2_1_39_1","volume-title":"April","author":"Yekhanin Sergey","year":"2011","unstructured":"Sergey Yekhanin . Personal communication , April 2011 . Sergey Yekhanin. Personal communication, April 2011."}],"event":{"name":"ITCS '13: Innovations in Theoretical Computer Science","location":"Berkeley California USA","acronym":"ITCS '13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 4th conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422494","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2422436.2422494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:15Z","timestamp":1750277655000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":39,"alternative-id":["10.1145\/2422436.2422494","10.1145\/2422436"],"URL":"https:\/\/doi.org\/10.1145\/2422436.2422494","relation":{},"subject":[],"published":{"date-parts":[[2013,1,9]]},"assertion":[{"value":"2013-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}