Name
Abstract | ||
|---|---|---|
A new rewriting code is proposed, that is, the code is suitable for Write Once Memory (wom) devices, for example flash memory, in which the new data may overwrite the old one under the constraint of never changing a 1-bit into a 0-bit. A greedy heuristic is introduced and its compression performance is analyzed. Experimental results show that its efficiency for certain distributions of binary input data may outperform that of state-of-the-art wom codes. Moreover, the technique can be applied to transform any rewriting code for i writing rounds, for any i≥1, into an enhanced rewriting code for i+1 rounds. |
Year | DOI | Venue |
|---|---|---|
2023 | 10.1016/j.ipl.2022.106312 | Information Processing Letters |
Keywords | DocType | Volume |
Write Once Memory,Information content,Fibonacci code,Rewriting codes,Design of algorithms | Journal | 179 |
ISSN | Citations | PageRank |
0020-0190 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gilad Baruch | 1 | 0 | 0.34 |
| Shmuel T. Klein | 2 | 434 | 77.80 |
| Dana Shapira | 3 | 144 | 32.15 |