{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T18:25:14Z","timestamp":1759775114798,"version":"3.37.3"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1718389"],"award-info":[{"award-number":["1718389"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/tcomm.2018.2840717","type":"journal-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T18:49:55Z","timestamp":1527274195000},"page":"5013-5027","source":"Crossref","is-referenced-by-count":5,"title":["Hamming Distance Computation in Unreliable Resistive Memory"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7636-2476","authenticated-orcid":false,"given":"Zehui","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9519-5143","authenticated-orcid":false,"given":"Clayton","family":"Schoeny","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3736-4345","authenticated-orcid":false,"given":"Lara","family":"Dolecek","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IRPS.2011.5784590"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IEDM.2005.1609462"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1088\/0022-3727\/44\/25\/255104"},{"key":"ref13","first-page":"89","article-title":"A novel CUxSiyO resistive memory in logic technology with excellent data retention and resistance distribution for embedded applications","author":"wang","year":"2010","journal-title":"Proc Symp Technol (VLSIT)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1088\/0957-4484\/22\/9\/095702"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2012.6165062"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00339-011-6279-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994111"},{"key":"ref18","first-page":"238","article-title":"An average-case analysis of the k-nearest neighbor classifier for noisy domains","author":"okamoto","year":"1997","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1038\/nature06932","article-title":"The missing memristor found","volume":"453","author":"strukov","year":"2008","journal-title":"Nature"},{"key":"ref3","first-page":"1718","article-title":"Memristor based computation-in-memory architecture for data-intensive applications","author":"hamdioui","year":"2015","journal-title":"Proc IEEE Design Autom Test Eur Conf (DATE)"},{"key":"ref6","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2013.2282132"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282569"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248043"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.01.015"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335653"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1088\/0957-4484\/20\/42\/425204"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/26\/8536744\/8365762-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8536744\/08365762.pdf?arnumber=8365762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:56:27Z","timestamp":1649444187000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8365762\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":18,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2018.2840717","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2018,11]]}}}