{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:30:05Z","timestamp":1758274205079},"reference-count":18,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T00:00:00Z","timestamp":1610150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,17]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>A major property of flash memory is that a 0-bit can be changed into a 1-bit, but the symmetric task of switching from a 1-bit to a zero may only be performed in blocks and is therefore often prohibited. This led to the development of rewriting codes using the same storage space more than once, subject to the constraint that 0-bits can be changed into 1-bits, but not vice versa. Context sensitive rewriting codes extend this idea by also incorporating information gathered from surrounding bits. Several new context sensitive rewriting codes are presented and analyzed, some of which are better than the state of the art for sparse input. Empirical simulations show a good match with the theoretical results.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaa169","type":"journal-article","created":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T04:07:38Z","timestamp":1604203658000},"page":"1200-1210","source":"Crossref","is-referenced-by-count":2,"title":["Enhanced Context Sensitive Flash Codes"],"prefix":"10.1093","volume":"65","author":[{"given":"Gilad","family":"Baruch","sequence":"first","affiliation":[{"name":"Department of Computer Science, Bar Ilan University, Ramat-Gan 52900, Israel"}]},{"given":"Shmuel T","family":"Klein","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Bar Ilan University, Ramat-Gan 52900, Israel"}]},{"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Ariel University, Ariel 40700, Israel"}]}],"member":"286","published-online":{"date-parts":[[2021,1,9]]},"reference":[{"key":"2022051812574786600_ref1","first-page":"45","article-title":"New approaches for context sensitive flash codes","volume-title":"Implementation and Application of Automata - 24th International Conference, CIAA 2019","author":"Gilad Baruch, Shmuel T. Klein, and Dana Shapira","year":"2019"},{"key":"2022051812574786600_ref2","article-title":"Flash memory mass storage architecture","author":"Assar","year":"1995"},{"issue":"2","key":"2022051812574786600_ref3","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1145\/1089733.1089735","article-title":"Algorithms and data structures for flash memories","volume":"37","author":"","year":"2005","journal-title":"ACM Comput. Surv."},{"issue":"10","key":"2022051812574786600_ref4","doi-asserted-by":"crossref","first-page":"5300","DOI":"10.1109\/TIT.2010.2059530","article-title":"Rewriting codes for joint information storage in flash memories","volume":"56","author":"","year":"2010","journal-title":"IEEE Trans. Information Theory"},{"key":"2022051812574786600_ref5","first-page":"1861","article-title":"Rewriting codes for flash memories based upon lattices, and an example using the E8 lattice","volume-title":"IEEE Globecom Workshop on Applications of Communication Theory to Emerging Memory Technologies, ACTEMT 2010","author":"","year":"2010"},{"issue":"1\u20133","key":"2022051812574786600_ref6","first-page":"1","article-title":"How to reuse a \u2018write-once\u2019 memory","volume":"55","author":"","year":"1982","journal-title":"Information and Control"},{"issue":"7","key":"2022051812574786600_ref7","doi-asserted-by":"crossref","first-page":"4520","DOI":"10.1109\/TIT.2013.2251455","article-title":"New constructions of WOM codes using the Wozencraft ensemble","volume":"59","author":"","year":"2013","journal-title":"IEEE Trans. Information Theory"},{"issue":"5","key":"2022051812574786600_ref8","doi-asserted-by":"crossref","first-page":"2669","DOI":"10.1109\/TIT.2019.2946483","article-title":"Explicit and efficient WOM codes of finite length","volume":"66","author":"","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2022051812574786600_ref9","first-page":"193","article-title":"Boosting the compression of rewriting on flash memory","volume-title":"Data Compression Conference, DCC 2014, Snowbird, UT, USA, 26\u201328 March, 2014","author":"","year":"2014"},{"issue":"1","key":"2022051812574786600_ref10","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1093\/comjnl\/bxy020","article-title":"Context sensitive rewriting codes for flash memory","volume":"62","author":"","year":"2019","journal-title":"Comput. J."},{"issue":"6","key":"2022051812574786600_ref11","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1093\/comjnl\/bxp046","article-title":"On the usefulness of Fibonacci compression codes","volume":"53","author":"","year":"2010","journal-title":"Comput. J."},{"issue":"2","key":"2022051812574786600_ref12","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TIT.1987.1057284","article-title":"Robust transmission of unbounded strings using Fibonacci representations","volume":"33","author":"","year":"1987","journal-title":"IEEE Trans. Information Theory"},{"key":"2022051812574786600_ref13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.dam.2015.11.003","article-title":"Random access to Fibonacci encoded files","volume":"212","author":"Klein","year":"2016","journal-title":"Discrete Applied Mathematics"},{"key":"2022051812574786600_ref14","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.tcs.2015.12.021","article-title":"Compressed matching for feature vectors","volume":"638","author":"Klein","year":"2016","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"2022051812574786600_ref15","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1142\/S012905410600442X","article-title":"Compressed pattern matching in JPEG images","volume":"17","author":"","year":"2006","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2022051812574786600_ref16","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxaa016","article-title":"Smaller compressed suffix arrays","author":"Ekaterina Benza","year":"2020","journal-title":"The Computer Journal"},{"key":"2022051812574786600_ref17","first-page":"179","article-title":"Repr\u00e9sentation des nombres naturels par Une somme des nombres de Fibonacci ou de nombres de Lucas","volume":"41","author":"Zeckendorf","year":"1972","journal-title":"Bull. Soc. Roy. Sci. Li\u00e8ge"},{"issue":"6","key":"2022051812574786600_ref18","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.ipl.2007.11.016","article-title":"Should one always use repeated squaring for modular exponentiation?","volume":"106","author":"","year":"2008","journal-title":"Inf. Process. Lett."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/5\/1200\/43728763\/bxaa169.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/5\/1200\/43728763\/bxaa169.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T12:58:22Z","timestamp":1652878702000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/65\/5\/1200\/6071858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,9]]},"references-count":18,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2021,1,9]]},"published-print":{"date-parts":[[2022,5,17]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaa169","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,5]]},"published":{"date-parts":[[2021,1,9]]}}}