Efficient Repair of Reed-Solomon Codes and Tamo-Barg Codes
Centre for Networked Intelligence, IISc via YouTube
Learn the Skills Netflix, Meta, and Capital One Actually Hire For
Stuck in Tutorial Hell? Learn Backend Dev the Right Way
Overview
Build a Learning Habit
Download Class Central's free printable study calendar
Download for Free
Join a technical lecture exploring the efficient repair mechanisms of Reed-Solomon codes and Tamo-Barg codes, where Prof. Lalitha Vadlamani from IIIT Hyderabad delves into polynomial evaluation codes and their repair frameworks. Learn about the trace-repair framework introduced by Guruswami-Wootters for efficient Reed-Solomon code repair, and discover the optimal construction achieving the cut-set bound by Tamo et al. Explore Tamo-Barg codes as optimal locally repairable codes (LRCs) with Reed-Solomon codes as their local components, understanding how single node failures are handled within local groups and how repair bandwidth can be optimized. Examine the construction of Tamo-Barg codes with optimally repairable local Reed-Solomon codes and understand their connection to codes with local regeneration.
Syllabus
Time: 5:00 PM - PM IST
Taught by
Centre for Networked Intelligence, IISc