TY - JOUR
T1 - Guided blocks WOM codes
AU - Baruch, Gilad
AU - Klein, Shmuel T.
AU - Shapira, Dana
N1 - Publisher Copyright:
© 2022 Elsevier B.V.
PY - 2023/1
Y1 - 2023/1
N2 - 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.
AB - 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.
KW - Design of algorithms
KW - Fibonacci code
KW - Information content
KW - Rewriting codes
KW - Write Once Memory
UR - http://www.scopus.com/inward/record.url?scp=85136107279&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2022.106312
DO - 10.1016/j.ipl.2022.106312
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85136107279
SN - 0020-0190
VL - 179
JO - Information Processing Letters
JF - Information Processing Letters
M1 - 106312
ER -