Coding and Algorithms for Memories

Vortragende/r (Mitwirkende/r)
Umfang3 SWS
SemesterSommersemester 2021
Stellung in StudienplänenSiehe TUMonline
TermineSiehe TUMonline




This course will address the study of memories from their physics, architecture, information, coding, and systems perspectives. The focus will be given for coding and algorithms for the management of memories and data storage. The focus will be mainly given to the study of non-volatile memories such as hard disk drives, flash memories, phase-change memories, and DNA storage.


This course deals with coding and algorithms for memories and data storage systems. The following topics will be studied in the course. * Write-once memory: capacity and code constructions. * Solids-state drives: Architecture, write amplification, and management algorithms. * Stuck-at cells: code constructions and bounds. * Constrained codes: Knuth's balancing algorithm, run-length limited codes, two-dimensional constrained codes. * Permutations: codes and bounds for the Kendall's tau metric. * The generalized sphere packing bound * Reconstructions: codes and algorithms * Insertions and deletions: codes and balls size analysis

Inhaltliche Voraussetzungen

Linear algebra

Lehr- und Lernmethoden

Lecture: The fundamental theoretical contents are presented in the lecture by a slide presentation and a virtual board via zoom and will be illustrated with examples. Students are encouraged to ask questions and discuss the topics of the lecture. Tutorial: In an accompanying tutorial, the contents of the lecture are applied to examples.