{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:30:56Z","timestamp":1729639856781,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282533","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T22:09:52Z","timestamp":1443737392000},"page":"641-645","source":"Crossref","is-referenced-by-count":7,"title":["Explicit capacity achieving codes for defective memories"],"prefix":"10.1109","author":[{"given":"Hessam","family":"Mahdavifar","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Vardy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875111"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258573"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-46796-3_7","article-title":"New sequences of linear time erasure codes approaching the channel capacity","author":"shokrollahi","year":"1999","journal-title":"Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.959255"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034823"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2341919"},{"article-title":"Polar codes for channel and source coding","year":"2009","author":"korada","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055963"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502495"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056763"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056723"},{"article-title":"Encoding and decoding data to accommodate memory cells having stuck-at faults","year":"2012","author":"mateescu","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2013.6655249"},{"key":"ref2","first-page":"968","article-title":"Algorithms for memories with stuck cells","author":"lastras-monta\u00f1o","year":"2010","journal-title":"proceedings of IEEE international symposium on Information Theory"},{"key":"ref1","first-page":"52","article-title":"Coding in a memory with defective cells","volume":"10","author":"kuznetsov","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"article-title":"Techniques for storing data in stuck memory cells","year":"2012","author":"mateescu","key":"ref9"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282533.pdf?arnumber=7282533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T05:15:29Z","timestamp":1567228529000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282533\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282533","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}