Abstract
Writing data on flash memory is asymmetric in the sense that it is possible to change a 0 into a 1-bit, but erasing a 1 back to value 0 is much more expensive and can only be done in blocks. This has triggered the development of rewriting codes in which new data can overwrite the old one, subject to the constraint of never changing a 1 into a 0. The notion of context-sensitive rewriting codes is introduced and we bring here the analysis of the compression performance of a family of such codes, based on generalizations of the Fibonacci sequence. This is then compared with experimental results.
| Original language | English |
|---|---|
| Pages (from-to) | 20-29 |
| Number of pages | 10 |
| Journal | Computer Journal |
| Volume | 62 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 2019 |
Bibliographical note
Publisher Copyright:© The British Computer Society 2018. All rights reserved.
Keywords
- Data Compression
- Fibonacci codes
- Write-once memory