BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium : Maximally recoverable codes
DTSTART:20171113T161500
DTEND:20171113T173000
DTSTAMP:20260406T171753Z
UID:0858ddda7efaea9479f351275ba2dfec19b30fcf21eaaead1c939f6c
CATEGORIES:Conferences - Seminars
DESCRIPTION:By : Sergey Yekhanin - Microsoft Research\n\nAbstract :\nIn re
 cent years the explosion in the volumes of data being stored online has re
 sulted in distributed storage systems transitioning to erasure coding base
 d schemes. Local Reconstruction Codes (LRCs) have emerged as the codes of 
 choice for these applications. An LRC is a q-ary code\, where encoding is 
 as a two stage process. On the first stage h redundant symbols are generat
 ed from k data symbols. On the second stage k+h symbols are partitioned in
 to smaller sets and each set is extended with a redundant symbols using an
  MDS code to form a local group. Local groups ensure that when a small num
 ber of coordinates are erased\, any missing coordinate can be recovered by
  accessing just a few symbols. Also\, if a larger number of coordinates is
  erased\; then missing symbols can still be recovered by potentially acces
 sing all remaining symbols.\nAn LRC code as above is Maximally Recoverable
  (MR)\, if it corrects all erasure patterns which are information theoreti
 cally correctable given the presence of local groups. Obtaining MR LRCs ov
 er finite fields of minimal size is important in practice and has been the
  goal of a line of work in coding theory. In this talk we review state of 
 the art in this area and present several new results\, including the first
  super-linear lower bound for the field size of maximally recoverable LRCs
 . (Joint work with Sivakanth Gopi and Venkat Guruswami).\n\nBio :\nSergey 
 Yekhanin received his Specialist Diploma from Moscow State University in 2
 002\, and his Ph.D. from MIT in 2007. In 2007-2008 he was a Member of the 
 School of Mathematics at the Institute for Advanced Study at Princeton. In
  2008 Dr. Yekhanin joined Microsoft Research  where he is currently a Sen
 ior Researcher. Dr. Yekhanin's research interests lie in algebraic coding 
 theory\, combinatorics\, and computational complexity theory. He is curren
 tly focusing on coding for distributed storage\, coding for DNA storage\, 
 and practical differentially private algorithms. Dr. Yekhanin is a recipie
 nt of the ACM Doctoral Dissertation Award (2007) and the IEEE Communicatio
 ns Society and Information Theory Society Joint Paper Award (2014). He has
  been an invited speaker at the 2014 International Congress of Mathematici
 ans.\n\nMore information\n 
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR