TY - GEN
T1 - Reconstruction from deletions in racetrack memories
AU - Chee, Yeow Meng
AU - Gabrys, Ryan
AU - Vardy, Alexander
AU - Vu, Van Khu
AU - Yaakobi, Eitan
N1 - Publisher Copyright: © 2018 IEEE Information Theory Workshop, ITW 2018. All rights reserved.
PY - 2018/7/2
Y1 - 2018/7/2
N2 - In this work, we study a special case of the reconstruction problem in order to combat position errors in racetrack memories. In these memories, the information is stored in magnetic cells that can be sensed by shifting them under read heads. However, since this shifting operation is not error free, recent work has been dedicated towards correcting these so-called position errors, which manifest themselves as deletions and sticky insertions. A deletion is the event where the cells are over-shifted, and a sticky insertion occurs when the cells are not shifted. We first present a code construction that uses two heads to correct two deletions with at most log2(log2 n) + 4 redundant bits. This result improves upon a recent one that requires roughly log2 n redundant bits. We then extend this construction to correct d deletions using d heads with at most log2(log2 n) + c redundant bits. Lastly, we extend our results and derive codes for the classical reconstruction problem by Levenshtein over the insertion/deletion channel.
AB - In this work, we study a special case of the reconstruction problem in order to combat position errors in racetrack memories. In these memories, the information is stored in magnetic cells that can be sensed by shifting them under read heads. However, since this shifting operation is not error free, recent work has been dedicated towards correcting these so-called position errors, which manifest themselves as deletions and sticky insertions. A deletion is the event where the cells are over-shifted, and a sticky insertion occurs when the cells are not shifted. We first present a code construction that uses two heads to correct two deletions with at most log2(log2 n) + 4 redundant bits. This result improves upon a recent one that requires roughly log2 n redundant bits. We then extend this construction to correct d deletions using d heads with at most log2(log2 n) + c redundant bits. Lastly, we extend our results and derive codes for the classical reconstruction problem by Levenshtein over the insertion/deletion channel.
UR - http://www.scopus.com/inward/record.url?scp=85062083413&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/ITW.2018.8613352
DO - https://doi.org/10.1109/ITW.2018.8613352
M3 - منشور من مؤتمر
T3 - 2018 IEEE Information Theory Workshop, ITW 2018
BT - 2018 IEEE Information Theory Workshop, ITW 2018
T2 - 2018 IEEE Information Theory Workshop, ITW 2018
Y2 - 25 November 2018 through 29 November 2018
ER -