IIIT Hyderabad Publications |
|||||||||
|
On Epsilon-MSCR Codes for Two ErasuresAuthors: Rekha Devi Bhoopatiraju,Lalitha Vadlamani Conference: The 2019 IEEE International Symposium on Information Theory (ISIT) Location Maison de la Mutualité in Paris Date: 2019-07-07 Report no: IIIT/TR/2019/90 AbstractCooperative regenerating codes are regenerating codes designed to tradeoff storage for repair bandwidth in case of multiplenode failures. Minimum storage cooperative regenerating (MSCR) codes are a class of cooperative regenerating codes whichachieve the minimum storage point of the tradeoff. Recently, these codes have been constructed for all possible parameters(n, k, d, h), whereherasures are repaired by contacting anydsurviving nodes. However, these constructions have very largesub-packetization.ǫ-MSR codes are a class of codes introduced to tradeoff subpacketization level for a slight increase in the repairbandwidth for the case of single node failures. We introducethe framework ofǫ-MSCR codes which allow for a similar tradeofffor the case of multiple node failures. We present a construction ofǫ-MSCR codes, which can recover from two node failures, byconcatenating a class of MSCR codes and scalar linear codes.We give a repair procedure to repair theǫ-MSCR codes in the eventof two node failures and calculate the repair bandwidth for the same. We characterize the increase in repair bandwidth incurred bythe method in comparison with the optimal repair bandwidth given by the cut-set bound. Finally, we show the subpacketizationlevel ofǫ-MSCR codes scales logarithmically in the number of nodes. Full paper: pdf Centre for Communications |
||||||||
Copyright © 2009 - IIIT Hyderabad. All Rights Reserved. |