{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:31:18Z","timestamp":1725517878125},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853626"},{"type":"electronic","value":"9783540853633"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85363-3_24","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T15:29:28Z","timestamp":1219850968000},"page":"290-302","source":"Crossref","is-referenced-by-count":2,"title":["Tensor Products of Weakly Smooth Codes Are Robust"],"prefix":"10.1007","author":[{"given":"Eli","family":"Ben-Sasson","sequence":"first","affiliation":[]},{"given":"Michael","family":"Viderman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Ben-Sasson, E., Sudan, M.: Robust locally testable codes and products of codes. In: APPROX-RANDOM, pp. 286\u2013297 (2004) (See ECCC TR04-046, 2004)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Dinur, I., Sudan, M., Wigderson, A.: Robust local testability of tensor products of LDPC codes. In: APPROX-RANDOM, pp. 304\u2013315 (2006)","DOI":"10.1007\/11830924_29"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Valiant, P.: The tensor product of two codes is not necessarily robustly testable. In: APPROX-RANDOM, pp. 472\u2013481 (2005)","DOI":"10.1007\/11538462_40"},{"key":"24_CR4","unstructured":"Copersmith, D., Rudra, A.: On the robust testability of tensor products of codes, ECCC TR05-104 (2005)"},{"key":"24_CR5","unstructured":"Meir, O.: On the rectangle method in proofs of robustness of tensor products, ECCC TR07 (2007)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Meir, O.: Combinatorial Construction of Locally Testable Codes. M.Sc. Thesis, Weizmann Institute of Science (2007)","DOI":"10.1145\/1374376.1374419"},{"key":"24_CR7","unstructured":"Goldreich, O., Meir, O.: The tensor product of two good codes is not necessarily robustly testable, ECCC TR07 (2007)"},{"key":"24_CR8","unstructured":"Goldreich, O.: Short locally testable codes and proofs (survey), ECCC TR05-014 (2005)"},{"key":"24_CR9","unstructured":"Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost linear length. In: FOCS (2002), pp. 13-22 (See ECCC TR02-050 2002)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Spielman, D.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. on Information Theory, 1723\u20131731 (1996)","DOI":"10.1109\/18.556668"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85363-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:34:10Z","timestamp":1558265650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85363-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540853626","9783540853633"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85363-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}