{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:33:23Z","timestamp":1763642003400,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"European Union\u2019s Horizon 2020 Research and Innovation Programme under the Marie Sklodowska-Curie","award":["655109"],"award-info":[{"award-number":["655109"]}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1624\/14"],"award-info":[{"award-number":["1624\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1109\/tit.2015.2512581","type":"journal-article","created":{"date-parts":[[2015,12,31]],"date-time":"2015-12-31T14:09:34Z","timestamp":1451570974000},"page":"639-654","source":"Crossref","is-referenced-by-count":9,"title":["Codes for Partially Stuck-At Memory Cells"],"prefix":"10.1109","volume":"62","author":[{"given":"Antonia","family":"Wachter-Zeh","sequence":"first","affiliation":[]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513379"},{"key":"ref30","first-page":"111","article-title":"Group additive defect-correcting codes","volume":"11","author":"tsybakov","year":"1975","journal-title":"Problems Inf Transmiss"},{"article-title":"Bounds on the minimum distance of linear codes and quantum codes","year":"2007","author":"grassl","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056763"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056723"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/RELPHY.2005.1493077"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2013.6655249"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055963"},{"key":"ref16","first-page":"28","article-title":"Coding in a channel with generalized defects and random errors","volume":"21","author":"kuznetsov","year":"1985","journal-title":"Problems Inf Transmiss"},{"key":"ref17","first-page":"52","article-title":"Coding for memories with defective cells","volume":"10","author":"kuznetsov","year":"1974","journal-title":"Problems Inf Transmiss"},{"key":"ref18","first-page":"968","article-title":"Algorithms for memories with stuck cells","author":"lastras-monta\u00f1o","year":"2010","journal-title":"Proc IEEE Int Sym Inf Theory"},{"key":"ref19","first-page":"1851","article-title":"An area and latency assessment for coding for memories with stuck cells","author":"lastras-monta\u00f1o","year":"2010","journal-title":"Proc IEEE GLOBECOM Workshops (GC Wkshps)"},{"key":"ref28","article-title":"Reliable computation and reliable storage of information","author":"tsybakov","year":"1975","journal-title":"IEEE-USSR Workshop Proc"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282711"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294464"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1116\/1.3301579"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1056992"},{"key":"ref29","first-page":"21","article-title":"Defects and error correction","volume":"11","author":"tsybakov","year":"1975","journal-title":"Problems Inf Transmiss"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2255732"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2344677"},{"key":"ref7","first-page":"1","article-title":"Steganography via codes for memory with defective cells","author":"fridrich","year":"2005","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057347"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/NVMT.2009.5429783"},{"key":"ref1","first-page":"62","article-title":"Codes that correct triple defects in memory","volume":"13","author":"belov","year":"1977","journal-title":"Problems Inf Transmiss"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LED.2009.2015222"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282533"},{"key":"ref21","first-page":"98","article-title":"Double-and-triple-defect-correcting codes","volume":"14","author":"losev","year":"1978","journal-title":"Problems Inf Transmiss"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90344-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TDMR.2004.836724"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2251455"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2010.46"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7384825\/7369966.pdf?arnumber=7369966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:35Z","timestamp":1641987995000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7369966\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":31,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2512581","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2016,2]]}}}