During the fall semester of 2017 we will run a reading group on coding for distributed storage. The primary source for this material will be the paper Locally recoverable codes on algebraic curves by Barg, Tamo, and Vladut. Notes will be posted on this website as they are available.

Location and Time:

Tuesdays and Thursdays 8:00 – 9:15 in Martin O-010


  • Travis Baumbaugh (grad)
  • Jim Brown (faculty)
  • Ben Case (grad)
  • Hugh Geller (grad)
  • Kevin James (faculty)
  • Huixi Li (grad)
  • Hiram Lopez (faculty)
  • Felice Manganiello (faculty)
  • Gretchen Matthews (faculty)
  • Andrew Pangia (grad)
  • Malcolm Rupert (faculty)
  • Kristen Savary (grad)
  • Changan Zhao (faculty)


  • RAID (Redundant Arrays of Inexpensive Disks)
  • Locally recoverable Reed-Solomon codes
  • Repairing Reed-Solomon codes
  • Repairing Reed-Solomon codes with multiple erasures
  • Locally recoverable codes from algebraic geometry
  • Batch codes