{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:21Z","timestamp":1725567561433},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_25","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T11:25:55Z","timestamp":1286450755000},"page":"312-319","source":"Crossref","is-referenced-by-count":5,"title":["Symmetric LDPC Codes and Local Testing"],"prefix":"10.1007","author":[{"given":"Tali","family":"Kaufman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/978-3-540-45198-3_17","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"N. Alon","year":"2003","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing Low Degree Polynomials Over GF(2). In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 188\u2013199. Springer, Heidelberg (2003); Also IEEE Transactions on Information Theory\u00a051(11), 4032\u20134039 (2005)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Lubotzky, A., Wigderson, A.: Semi Direct product in groups and zig-zag product in graphs: connections and applictions. In: Proceedings of the 42nd Annual Symposium on the Foundations of Computer Science (FOCS), pp. 630\u2013637 (2001)","DOI":"10.1109\/SFCS.2001.959939"},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00493-003-0025-0","volume":"23","author":"S. Arora","year":"2003","unstructured":"Arora, S., Sudan, M.: Improved low degree testing and its applications. Combinatorica\u00a023(3), 365\u2013426 (2003)","journal-title":"Combinatorica"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01200056","volume":"1","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Computational Complexity\u00a01(1), 3\u201340 (1991)","journal-title":"Computational Complexity"},{"issue":"8","key":"25_CR5","doi-asserted-by":"publisher","first-page":"2849","DOI":"10.1109\/TIT.2005.851735","volume":"51","author":"L. Babai","year":"2005","unstructured":"Babai, L., Shpilka, A., Stefankovic, D.: Locally testable cyclic codes. IEEE Transactions on Information Theory\u00a051(8), 2849\u20132858 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539704445445","volume":"35","author":"E. Ben-Sasson","year":"2005","unstructured":"Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3CNF Properties are Hard to Test. SIAM Journal on Computing\u00a035(1), 1\u201321 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Sudan, M.: Simple PCPs with poly-log rate and query complexity. In: STOC 2005, 266\u2013275 (2005)","DOI":"10.1145\/1060590.1060631"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Sudan, M., Vadhan, S., Wigderson, A.: Randomness-efficient Low Degree Tests and Short PCPs via Epsilon-Biased Sets. In: 35th Annual ACM Symposium, STOC 2003, pp. 612\u2013621 (2003)","DOI":"10.1145\/780542.780631"},{"key":"25_CR9","first-page":"21","volume":"3","author":"S.D. Berman","year":"1967","unstructured":"Berman, S.D.: Semisimple Cyclic and Abelian Codes. Cybernetics\u00a03, 21\u201330 (1967)","journal-title":"Cybernetics"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-Testing\/Correcting with Applications to Numerical Problems. J. Comp. Sys. Sci.\u00a047(3) (December 1993)","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Capalbo, M., Reingold, O., Vadhan, S., Wigderson, A.: Randomness Conductors and Constant-Degree Expansion Beyond the Degree\/2 Barrier. In: Proceedings of the 34th STOC, pp. 659\u2013668 (2002)","DOI":"10.1145\/509907.510003"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1215\/S0012-7094-57-02406-7","volume":"24","author":"L. Carlitz","year":"1957","unstructured":"Carlitz, L., Uchiyama, S.: Bounds for exponential sums. Duke Math. J.\u00a024, 37\u201341 (1957)","journal-title":"Duke Math. J."},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I. Dinur","year":"2007","unstructured":"Dinur, I.: The PCP theorem by gap amplification. J. ACM\u00a054(3), 12 (2007)","journal-title":"J. ACM"},{"key":"25_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low density parity check codes","author":"R.G. Gallager","year":"1963","unstructured":"Gallager, R.G.: Low density parity check codes. MIT Press, Cambridge (1963)"},{"key":"25_CR15","unstructured":"Grigorescu, E., Kaufman, T., Sudan, M.: Succinct Representation of Codes with Applications to Testing (manuscript)"},{"issue":"4","key":"25_CR16","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/1162349.1162351","volume":"53","author":"O. Goldreich","year":"2006","unstructured":"Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost-linear length. J. ACM\u00a053(4), 558\u2013655 (2006)","journal-title":"J. ACM"},{"key":"25_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662058","volume-title":"The Petersen Graph","author":"D.A. Holton","year":"1993","unstructured":"Holton, D.A., Sheehan, J.: The Petersen Graph. Cambridge University Press, Cambridge (1993)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Kaufman, T., Sudan, M.: Algebraic Property Testing: The Role of Invariance. In: Proceedings of the 40th ACM Symposium on Theory of Computing, STOC (2008)","DOI":"10.1145\/1374376.1374434"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Kaufman, T., Litsyn, S.: Almost Orthogonal Linear Codes are Locally Testable. In: FOCS 2005, pp. 317\u2013326 (2005)","DOI":"10.1109\/SFCS.2005.16"},{"issue":"3","key":"25_CR20","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1017\/S0305004108002089","volume":"146","author":"M. Lackenby","year":"2009","unstructured":"Lackenby, M.: Large groups, property (\u03c4) and the homology growth of subgroups. Math. Proc. Cambridge Philos. Soc.\u00a0146(3), 625\u2013648 (2009)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1215\/S0012-7094-07-13616-0","volume":"136","author":"M. Lackenby","year":"2007","unstructured":"Lackenby, M.: Covering spaces of 3-orbifolds. Duke Math. J.\u00a0136(1), 181\u2013203 (2007)","journal-title":"Duke Math. J."},{"issue":"2","key":"25_CR22","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/18.910576","volume":"47","author":"M.G. Luby","year":"2001","unstructured":"Luby, M.G., Mitzenmacher, M., Amin Shokrollahi, M., Spielman, D.A.: Improved Low-Density Parity-Check Codes Using Irregular Graphs. IEEE Transactions on Information Theory\u00a047(2), 585\u2013598 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR23","series-title":"DIMACS Ser. Discrete Math. Theoret. Compt. Sci.","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1090\/dimacs\/010\/08","volume-title":"Expanding Graphs","author":"A. Lubotzky","year":"1993","unstructured":"Lubotzky, A., Weiss, B.: Groups and expanders. In: Friedman, e.J. (ed.) Expanding Graphs. DIMACS Ser. Discrete Math. Theoret. Compt. Sci., vol.\u00a010, pp. 95\u2013109. Amer. Math. Soc., Providence (1993)"},{"key":"25_CR24","volume-title":"The Theory of Error Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloan, N.J.A.: The Theory of Error Correcting Codes. North Holland, Amsterdam (1977)"},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TIT.1970.1054508","volume":"IT-16","author":"R.J. McElice","year":"1970","unstructured":"McElice, R.J.: On the Symmetry of Good Nonlinear Codes. IEEE Trans. Inform. Theory\u00a0IT-16, 609\u2013611 (1970)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Meir, O.: Combinatorial Construction of Locally Testable Codes. In: Proceedings of STOC 2008, pp. 285\u2013294 (2008)","DOI":"10.1145\/1374376.1374419"},{"issue":"4","key":"25_CR27","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s00493-004-0040-9","volume":"24","author":"R. Meshulam","year":"2004","unstructured":"Meshulam, R., Wigderson, A.: Expanders in Group Algebras. Combinatorica\u00a024(4), 659\u2013680 (2004)","journal-title":"Combinatorica"},{"issue":"2","key":"25_CR28","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Rozenman, E., Shalev, A., Wigderson, A.: A new family of Cayley expanders (?) In: 36th Annual ACM Symposium, STOC 2004, pp. 445\u2013454 (2004)","DOI":"10.1145\/1007352.1007423"},{"issue":"2","key":"25_CR30","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"T. Richardson","year":"2001","unstructured":"Richardson, T., Urbanke, R.: The Capacity of Low-Density Parity Check Codes under Message-Passing Decoding. IEEE Transactions on Information Theory\u00a047(2), 599\u2013618 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"25_CR31","doi-asserted-by":"publisher","first-page":"157","DOI":"10.2307\/3062153","volume":"155","author":"O. Reingold","year":"2002","unstructured":"Reingold, O., Vadhan, S., Wigderson, A.: Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders. Annals of Mathematics\u00a0155(1), 157\u2013187 (2002)","journal-title":"Annals of Mathematics"},{"issue":"6","key":"25_CR32","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 Transactions on Information Theory\u00a042(6), 1710\u20131722 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR33","unstructured":"Sudan, M.: Lecture notes, http:\/\/people.csail.mit.edu\/madhu\/FT01\/scribe\/bch.ps"},{"issue":"2","key":"25_CR34","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jcss.2000.1730","volume":"62","author":"M. Sudan","year":"2001","unstructured":"Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR Lemma. Journal of Computer and System Sciences\u00a062(2), 236\u2013266 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"25_CR35","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"R.M. Tanner","year":"1981","unstructured":"Tanner, R.M.: A recursive approach to low complexity codes. IEEE Transactions on Information Theory\u00a027(5), 533\u2013547 (1981)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR36","unstructured":"Weil, A.: Sur les courbes algebriques et les varietes qui s\u2019en deduisent. Actualities Sci. et Ind. no. 1041. Hermann, Paris (1948)"}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T05:10:48Z","timestamp":1559711448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}