Transverse-Read-Codes for Domain Wall Memories

Yeow Meng Chee, Alexander Vardy, Van Khu Vu, Eitan Yaakobi

Research output: Contribution to journalArticlepeer-review


Transverse-read is a novel technique to detect the number of '1's stored in a domain wall memory, also known as racetrack memory, without shifting any domains. Motivated by the technique, we propose a novel scheme to combine transverse-read and shift-operation such that we can reduce the number of shift-operations while still achieving high capacity. We also show that this scheme is helpful to correct errors in domain wall memory. A set of valid-words in this transverse-read channel is called a transverse-read code. Our goal in this work is to study transverse-read codes with respect to their properties, capacity, and applications. We first present several properties of transverse-read codes and show that they are equivalent to a family of constrained codes. Then, we compute the maximal asymptotic rate of transverse-read codes for certain parameters. Furthermore, we also present several constructions of transverse-read codes with high rate. Finally, we design several transverse-read codes that can correct limited-shift-errors and limited-magnitude errors in domain wall memory.

Original languageEnglish
Pages (from-to)784-793
Number of pages10
JournalIEEE journal on selected areas in information theory
StatePublished - 2023


  • Racetrack memories
  • constrained codes
  • shift-errors
  • transverse-read

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Media Technology
  • Artificial Intelligence
  • Applied Mathematics


Dive into the research topics of 'Transverse-Read-Codes for Domain Wall Memories'. Together they form a unique fingerprint.

Cite this