{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:54Z","timestamp":1759063494591,"version":"3.37.3"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T00:00:00Z","timestamp":1520294400000},"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":[[2019,1,1]]},"DOI":"10.1093\/comjnl\/bxy020","type":"journal-article","created":{"date-parts":[[2018,2,13]],"date-time":"2018-02-13T23:11:36Z","timestamp":1518563496000},"page":"20-29","source":"Crossref","is-referenced-by-count":8,"title":["Context Sensitive Rewriting Codes for Flash Memory\u2020"],"prefix":"10.1093","volume":"62","author":[{"given":"Shmuel T","family":"Klein","sequence":"first","affiliation":[{"name":"Department of Computer Science, Bar Ilan University, Ramat-Gan, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2320-9064","authenticated-orcid":false,"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Ariel University, Ariel, Israel"}]}],"member":"286","published-online":{"date-parts":[[2018,3,6]]},"reference":[{"year":"1995","author":"Assar","key":"key\n\t\t\t\t2019011011280682700_bxy020C1"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C2","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1145\/1089733.1089735","article-title":"Algorithms and data structures for flash memories","volume":"37","author":"Gal","year":"2005","journal-title":"ACM Comput. Surv."},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(82)90344-8","article-title":"How to reuse a \u2018write-once\u2019 memory","volume":"55","author":"Rivest","year":"1982","journal-title":"Inf. Control"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C4","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1109\/TIT.1984.1056918","article-title":"Generalized \u2018write-once\u2019 memories","volume":"30","author":"Fiat","year":"1984","journal-title":"IEEE Trans. Inf. Theory"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C5","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":"Jiang","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"year":"2010","author":"Kurkoski","key":"key\n\t\t\t\t2019011011280682700_bxy020C6"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C7","doi-asserted-by":"crossref","first-page":"5088","DOI":"10.1109\/TIT.2013.2255732","article-title":"Polar write once memory codes","volume":"59","author":"Burshtein","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C8","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":"Shpilka","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C9","doi-asserted-by":"crossref","first-page":"5985","DOI":"10.1109\/TIT.2012.2200291","article-title":"Codes for write-once memories","volume":"58","author":"Yaakobi","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C10","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1093\/comjnl\/bxp046","article-title":"On the usefulness of Fibonacci compression codes","volume":"53","author":"Klein","year":"2010","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1080\/00029890.1985.11971550","article-title":"Systems of numeration","volume":"92","author":"Fraenkel","year":"1985","journal-title":"Amer. Math. Mon."},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C12","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"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C13","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":"Apostolico","year":"1987","journal-title":"IEEE Trans. Inf. Theory"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0166-218X(93)00116-H","article-title":"Robust universal complete codes for transmission and compression","volume":"64","author":"Fraenkel","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C15","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 Appl. Math."},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C16","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."},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.3390\/a4010061","article-title":"Compressed matching in dictionaries","volume":"4","author":"Klein","year":"2011","journal-title":"Algorithms"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C18","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":"Klein","year":"2008","journal-title":"Inf. Process. Lett."},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1109\/18.971760","article-title":"On multiple insertion\/deletion correcting codes","volume":"48","author":"Helberg","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"year":"1985","author":"Immink","key":"key\n\t\t\t\t2019011011280682700_bxy020C20"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C21","doi-asserted-by":"crossref","first-page":"1745","DOI":"10.1109\/5.63306","article-title":"Runlength-limited sequences","volume":"78","author":"Schouhamer Immink","year":"1990","journal-title":"Proc. IEEE"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C22","volume-title":"The Art of Computer Programming, Volume I: Fundamental Algorithms","author":"Knuth","year":"1973","edition":"2nd edn"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C23","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1109\/TIT.1981.1056387","article-title":"On universal codeword sets","volume":"27","author":"Lakshmanan","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"key":"key\n\t\t\t\t2019011011280682700_bxy020C24","first-page":"2885","article-title":"Variable-length prefix codes with multiple delimiters","volume":"63","author":"Anisimov","year":"2017","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/62\/1\/20\/27493060\/bxy020.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T19:04:31Z","timestamp":1570734271000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/62\/1\/20\/4922802"}},"subtitle":[],"editor":[{"given":"Prudence","family":"Wong","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2018,3,6]]},"references-count":24,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,3,6]]},"published-print":{"date-parts":[[2019,1,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxy020","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2019,1]]},"published":{"date-parts":[[2018,3,6]]}}}