Codes correcting limited-shift errors in racetrack memories
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...
Main Authors: | Chee, Yeow Meng, Kiah, Han Mao, Vardy, Alexander, Vu, Van Khu, Yaakobi, Eitan |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Conference Paper |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/142978 |
Similar Items
-
Locally-constrained de Bruijn codes: properties, enumeration, code constructions, and applications
by: Chee, Yeow Meng, et al.
Published: (2022) -
On the Positional Single Error Correction and Double Error Detection in Racetrack Memories
by: Awais Saeed, et al.
Published: (2023-01-01) -
Correcting deletions with multiple reads
by: Chrisnata, Johan, et al.
Published: (2022) -
Temporal Memory With Magnetic Racetracks
by: Hamed Vakili, et al.
Published: (2020-01-01) -
Low-power cooling codes with efficient encoding and decoding
by: Chee, Yeow Meng, et al.
Published: (2020)