{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:35Z","timestamp":1759638995925},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642036842"},{"type":"electronic","value":"9783642036859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03685-9_26","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T22:39:51Z","timestamp":1250807991000},"page":"339-351","source":"Crossref","is-referenced-by-count":19,"title":["Deterministic Approximation Algorithms for the Nearest Codeword Problem"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Rina","family":"Panigrahy","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Yekhanin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on average case vs. approximation complexity. In: Proc. of the 44rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 298\u2013307 (2003)","DOI":"10.1109\/SFCS.2003.1238204"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1006\/jcss.1997.1472","volume":"54","author":"S. Arora","year":"1997","unstructured":"Arora, S., Babai, L., Stern, J., Sweedyk, Z.: Hardness of approximate optima in lattices, codes, and linear systems. Journal of Computer and System Sciences\u00a054(2), 317\u2013331 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR3","unstructured":"Berman, P., Karpinski, M.: Approximating minimum unsatisfiability of linear equations. In: Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 514\u2013516 (2002)"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TIT.2002.806118","volume":"49","author":"I. Dumer","year":"2003","unstructured":"Dumer, I., Miccancio, D., Sudan, M.: Hardness of approximating the minimum distance of a linear code. IEEE Transactions on Information Theory\u00a049(1), 22\u201337 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF01303207","volume":"13","author":"J. Friedman","year":"1993","unstructured":"Friedman, J.: A note on matrix rigidity. Combinatorica\u00a013(2), 235\u2013239 (1993)","journal-title":"Combinatorica"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s00037-005-0193-y","volume":"14","author":"V. Guruswami","year":"2005","unstructured":"Guruswami, V., Micciancio, D., Regev, O.: The complexity of the covering radius problem. Computational Complexity\u00a014, 90\u2013120 (2005)","journal-title":"Computational Complexity"},{"issue":"4","key":"26_CR7","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/BF02311250","volume":"63","author":"B. Kashin","year":"1998","unstructured":"Kashin, B., Razborov, A.: Improved lower bounds on the rigidity of Hadamard matrices. Mathematical Notes\u00a063(4), 471\u2013475 (1998)","journal-title":"Mathematical Notes"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jcss.2001.1786","volume":"63","author":"S. Lokam","year":"2001","unstructured":"Lokam, S.: Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity. Journal of Computer and System Sciences\u00a063(3), 449\u2013473 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"26_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0020-0190(97)00190-7","volume":"64","author":"M. Shokrollahi","year":"1997","unstructured":"Shokrollahi, M., Speilman, D., Stemann, V.: A remark on matrix rigidity. Information Processing Letters\u00a064(6), 283\u2013285 (1997)","journal-title":"Information Processing Letters"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Valiant, L.: Graph-theoretic arguments in low level complexity. In: Proc. of 6th Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 162\u2013176 (1977)","DOI":"10.1007\/3-540-08353-7_135"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03685-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T08:26:04Z","timestamp":1552119964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03685-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036842","9783642036859"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03685-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}