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
|Graduate Studies
Pre-required courses

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

Semestrial Information

Weekly Hours

3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours • 1 Project Hours

Go to Course Page

Go to Course Page


Responsible(s)

Eitan Yaakobi


Exams
Session A: 02-02-2023 Session B: 02-03-2023
Registration Groups
11
Lecture Sunday 10:30 - 12:30 טאוב 4 | Eitan Yaakobi
Exercise Wednesday 11:30 - 12:30 טאוב 6 | Daniella Bar Lev
Weekly Hours

3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours • 1 Project Hours

Go to Course Page

Go to Course Page


Responsible(s)

Eitan Yaakobi

Notes
  • התרגול בקורס ינתן בזום.

Registration Groups
11
Lecture Sunday 10:30 - 12:30 טאוב 3 | Eitan Yaakobi
Exercise Sunday 12:30 - 13:30 טאוב 3 | Daniella Bar Lev
Weekly Hours

3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours • 1 Project Hours

Go to Course Page

Go to Course Page


Responsible(s)

Eitan Yaakobi

Notes
  • נשאר מקום למס' מצומצם של נרשמים. ניתן לשלוח בקשה למרצה + גליון ציונים

Registration Groups
11
Lecture Sunday 10:30 - 12:30 טאוב 3 | Eitan Yaakobi
Exercise Sunday 12:30 - 13:30 טאוב 3 | Daniella Bar Lev
69
Enrollment Group No information regarding course hours