Lecture, four hours; discussion, one hour; outside study, seven hours. Requisite: course 131A or equivalent. Research developments in new mathematical techniques for emerging large-scale, ultra-reliable, fast, and affordable data storage systems. Topics include, but are not limited to, graph-based codes and algebraic codes and decoders for modern storage devices (e.g., Flash), rank modulation, rewriting codes, algorithms for data deduplication and synchronization, and redundant array of independent disks (RAID) systems. Letter grading.