{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:44:36Z","timestamp":1730274276107,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8007052","type":"proceedings-article","created":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T16:23:00Z","timestamp":1503332580000},"page":"2860-2864","source":"Crossref","is-referenced-by-count":6,"title":["Explicit constructions of finite-length WOM codes"],"prefix":"10.1109","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[]},{"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Vard","sequence":"additional","affiliation":[]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282824"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2352213"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2200291"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2134370"},{"key":"ref34","article-title":"Write once, get 50% free: Saving SSD erase costs using WOM codes","author":"yadgar","year":"2015","journal-title":"USENIX FAST"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.737544"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095232"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.746827"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90055-0"},{"journal-title":"Bounds On The Minimum Distance Of Linear Codes And Quantum Codes","year":"0","author":"grassl","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1056994"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7446994"},{"journal-title":"The devil is in the details Implementing flash page reuse with WOM codes","year":"2016","author":"margaglia","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.21236\/AD0407946"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00115.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2318722"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF00150939"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5015-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057221"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513379"},{"article-title":"Cooling codes: Thermal-management coding for high-performance interconnects","year":"0","author":"chee","key":"ref5"},{"key":"ref8","first-page":"3","article-title":"Asymptotically optimal codes correcting memory defects of fixed multiplicity","volume":"25","author":"dumer","year":"1989","journal-title":"Probl Peredachi Inform"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2255732"},{"key":"ref9","first-page":"646","article-title":"Rewriting flash memory by message passing","author":"en","year":"2015","journal-title":"Proc IEEE Int'l Symp Information Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90174-0"},{"key":"ref20","first-page":"227","article-title":"Womcodes constructed with projective geometries","volume":"1","author":"merkx","year":"1984","journal-title":"Traitement du Signal"},{"journal-title":"Introduction to Coding Theory","year":"2005","author":"roth","key":"ref22"},{"key":"ref21","first-page":"110","article-title":"NAND flash architectures reducing write amplification through multiwrite codes","author":"odeh","year":"2014","journal-title":"30th Symp on Mass Storage Systems and Technologies (MSST)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2001.3188"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90344-8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2251455"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294464"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08007052.pdf?arnumber=8007052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,2]],"date-time":"2020-02-02T04:30:13Z","timestamp":1580617813000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8007052\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8007052","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}