Results 11 to 20 of about 197 (185)
Partial MDS Codes With Regeneration [PDF]
IEEE Transactions on Information Theory, 2021 Extended version of arXiv:2001 ...
Lukas Holzbaur +3 more
openaire +2 more sources
Codes with local regeneration [PDF]
2013 IEEE International Symposium on Information Theory, 2013 44 pages, 7 figures. A class of codes termed as Uniform Rank Accumulation (URA) codes is introduced and a minimum distance bound is derived when the local codes are URA codes. Also, the results of our earlier arXiv submssion(arXiv:1202:2414[cs.IT]) are included in Section 3 of this ...
Govinda M. Kamath +3 more
openaire +2 more sources
Regenerating Codes: A System Perspective [PDF]
2012 IEEE 31st Symposium on Reliable Distributed Systems, 2012 The explosion of the amount of data stored in cloud systems calls for more efficient paradigms for redundancy. While replication is widely used to ensure data availability, erasure correcting codes provide a much better trade-off between storage and availability.
Steve Jiekak +4 more
openaire +2 more sources
Multilevel diversity coding with regeneration [PDF]
2015 IEEE International Symposium on Information Theory (ISIT), 2015 Revised version; 24 pages, 2 figures; Accpted, IEEE Trans ...
Chao Tian 0002, Tie Liu 0002
openaire +2 more sources
Cooperative Regenerating Codes [PDF]
IEEE Transactions on Information Theory, 2013 29 pages, 13 figures, submitted to IEEE Trans.
Kenneth W. Shum, Yuchong Hu
openaire +2 more sources
Non-coding RNAs in Cardiac Regeneration [PDF]
Frontiers in Physiology, 2021 The adult heart has a limited capacity to replace or regenerate damaged cardiac tissue following severe myocardial injury. Thus, therapies facilitating the induction of cardiac regeneration holds great promise for the treatment of end-stage heart failure, and for pathologies invoking severe cardiac dysfunction as a result of cardiomyocyte death ...
Yuan, Ting, Krishnan, Jaya
openaire +4 more sources
Simple regenerating codes: Network coding for cloud storage [PDF]
2012 Proceedings IEEE INFOCOM, 2012 9 pages, 10 figures, submitted for ...
Dimitris S. Papailiopoulos +4 more
openaire +2 more sources
Byzantine fault tolerance of regenerating codes [PDF]
2011 IEEE International Conference on Peer-to-Peer Computing, 2011 In The 11th IEEE International Conference on Peer-to-Peer Computing (P2P 2011)
Frédérique E. Oggier, Anwitaman Datta
openaire +3 more sources
Partial MDS Codes with Local Regeneration [PDF]
2020 IEEE International Symposium on Information Theory (ISIT), 2020 Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes where each local code is a bandwidth-optimal regenerating MDS code. The constructions require significantly smaller field size than the only other construction known in literature.
Holzbaur, Lukas +3 more
openaire +3 more sources
Minimum Storage Regenerating Codes for All Parameters [PDF]
IEEE Transactions on Information Theory, 2016 Regenerating codes for distributed storage have attracted much research interest in the past decade. Such codes trade the bandwidth needed to repair a failed node with the overall amount of data stored in the network. Minimum storage regenerating (MSR) codes are an important class of optimal regenerating codes that minimize (first) the amount of data ...
Sreechakra Goparaju +2 more
openaire +4 more sources