Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point
Information Theory
2018-11-14 v1 math.IT
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.
Cite
@article{arxiv.1712.03326,
title = {Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point},
author = {Shuo Shao and Tie Liu and Chao Tian and Cong Shen},
journal= {arXiv preprint arXiv:1712.03326},
year = {2018}
}