Memories and Information Storage Systems, Rewriting Codes And Write-once Memory Codes, Structure of Flash Memories, The Connection Between Write Amplification and Over Provisioning, Garbage Collection Algorithms, Implementation of Codes in Flash Memories, Codes For Stuck-at Cells, Codes For Constraints in Memories, Rank Modulation For Flash Memories and Codes Over Permutations, Codes For Deletions Correction, Codes For Reconstruction of Words, Codes For Dna-based Storage Systems, Bounds On Codes. Learning Outcomes# By The End of The Course, The Student Will Understand# 1) The Concept Of Coding and Algorithms For Memories and Storage Systems, 2) How To Design Codes For Error Correction and For Constrains in Memories.

Faculty: Computer Science
|Undergraduate Studies |Graduate Studies

Pre-required courses

(104134 - Modern Algebra H and 234247 - Algorithms 1)

Semestrial Information