{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T07:18:03Z","timestamp":1761981483238,"version":"build-2065373602"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/tit.2014.2340869","type":"journal-article","created":{"date-parts":[[2014,7,30]],"date-time":"2014-07-30T20:45:34Z","timestamp":1406753134000},"page":"6636-6645","source":"Crossref","is-referenced-by-count":7,"title":["A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem"],"prefix":"10.1109","volume":"60","author":[{"given":"Per","family":"Austrin","sequence":"first","affiliation":[]},{"given":"Subhash","family":"Khot","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1089023.1089027"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2014.17"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226652"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref19","first-page":"216","article-title":"Probabilistic algorithms for sparse polynomials","volume":"72","author":"zippel","year":"1979","journal-title":"Proc Int Symp Symbolic Algebr Manipulat"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2209198"},{"key":"ref6","first-page":"10","article-title":"The shortest vector problem in L2 is NP-hard for randomized reductions","author":"ajtai","year":"1998","journal-title":"Proc 30th ACM Symp Theory Comput"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0273-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700373039"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1649"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2060234"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806118"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.07.002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/070712109"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a003"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6895347\/06868217.pdf?arnumber=6868217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:51:19Z","timestamp":1642006279000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6868217\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":21,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2340869","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2014,10]]}}}