Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/142978
Title: | Codes correcting limited-shift errors in racetrack memories | Authors: | Chee, Yeow Meng Kiah, Han Mao Vardy, Alexander Vu, Van Khu Yaakobi, Eitan |
Keywords: | Science::Mathematics | Issue Date: | 2018 | Source: | Chee, Y. M., Kiah, H. M., Vardy, A., Vu, V. K., & Yaakobi, E. (2018). Codes correcting limited-shift errors in racetrack memories. Proceedings of 2018 IEEE International Symposium on Information Theory (ISIT 2018), 96-100. doi:10.1109/ISIT.2018.8437483 | Conference: | 2018 IEEE International Symposium on Information Theory (ISIT 2018) | Abstract: | In this work, we study limited-shift errors in racetrack memories and propose several schemes to combat these errors. There are two kinds of shift errors, namely under-shift errors, that can be modeled as sticky-insertions and limited-over-shift errors, that can be modeled as bursts of deletions of limited length. One approach to tackle the problem is to use deletion/sticky-insertion-correcting codes. Using this approach, we present a new family of asymptotically optimal codes that correct multiple bursts of deletions of limited length and any number of sticky insertions. We then study another approach that takes advantage of the special features of racetrack memories and the ability to add extra heads for redundancy. Here, we propose how to place the extra heads and construct codes to correct these shift errors. | URI: | https://hdl.handle.net/10356/142978 | ISBN: | 978-1-5386-4102-6 | DOI: | 10.1109/ISIT.2018.8437483 | Schools: | School of Physical and Mathematical Sciences | Rights: | © 2018 IEEE. All rights reserved. | Fulltext Permission: | none | Fulltext Availability: | No Fulltext |
Appears in Collections: | SPMS Conference Papers |
SCOPUSTM
Citations
20
14
Updated on Mar 26, 2024
Page view(s)
319
Updated on Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.