Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point
arXiv:1712.03326 · doi:10.3390/e20100751
Abstract
The problem of multilevel diversity coding with secure regeneration (MDC-SR) is considered, which includes the problems of multilevel diversity coding with regeneration (MDC-R) and secure regenerating code (SRC) as special cases. Two outer bounds are established, showing that separate coding of different messages using the respective SRCs can achieve the minimum-bandwidth-regeneration (MBR) point of the achievable normalized storage-capacity repair-bandwidth tradeoff regions for the general MDC-SR problem. The core of the new converse results is an exchange lemma, which can be established using Han's subset inequality.
References in corpus (5)
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes
- Layered, Exact-Repair Regenerating Codes Via Embedded Error Correction and Block Designs
- General Sub-packetized Access-Optimal Regenerating Codes
- An Explicit Construction of Systematic MDS Codes with Small Sub-packetization for All-Node Repair