BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1250
DTSTAMP:20230914T125956Z
SUMMARY:Maximally Recoverable Codes for Distributed Storage Systems
DESCRIPTION:Speaker: Lalitha Vadlamani (IIIT Hyderabad)\n\nAbstract: \nIn a
  distributed storage system\, due to increase of storage capacity of a nod
 e\, efficient repair of failed nodes is becoming increasingly important in
  addition to ensuring a given level of reliability and low storage overhea
 d. Codes with locality are a class of codes designed for storage systems w
 hich have the characteristic that they trade off repair locality (number o
 f nodes accessed to repair a failed node) for storage overhead.\n\nMaximal
 ly recoverable codes are a class of codes which correct maximum possible n
 umber of erasure patterns\, given the locality constraints of the code and
  hence of interest. Two classes of maximally recoverable codes (MRC) based
  on the topology of the local parities will be introduced (i) MRC with hie
 rarchical locality (ii) MRCs with product topologies. For the case of MRC 
 with hierarchical locality\, we will present explicit constructions for al
 l parameters and field size bounds. For the case of MRCs with product topo
 logies\, we describe a certain regularity condition necessary for the eras
 ure patterns to be recoverable. Also\, we establish a connection between t
 he regularity condition and a complete matching in a suitably constructed 
 bipartite graph. This is joint work with D. Shivakrishna\, Aaditya M. Nair
 \, V. Arvind Rameshwar and Birenjith Sasidharan.\nBio: Lalitha Vadlamani r
 eceived the B.E. degree in electronics and communication engineering from 
 Osmania University\, Hyderabad\, in 2003\, and the M.E. and Ph.D. degrees 
 from the Indian Institute of Science (IISc)\, Bengaluru\, in 2005 and 2015
 \, respectively.  Since May 2015\, she has been working as an Assistant P
 rofessor with IIIT Hyderabad\, where she is currently with the Signal Proc
 essing and Communications Research Center. Her research interests include 
 coding for distributed storage and computing\, index coding\, polar codes\
 , learning-based codes and coded blockchains. She was a recipient of Prof.
  I. S. N. Murthy medal from IISc in 2005\, and the TCS Research Scholarshi
 p for the year 2011. Her article won the runner up best paper award at NCC
  2019.\n
URL:https://www.tcs.tifr.res.in/web/events/1250
DTSTART;TZID=Asia/Kolkata:20221111T113000
DTEND;TZID=Asia/Kolkata:20221111T123000
LOCATION:A201
END:VEVENT
END:VCALENDAR