Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point.
ENTROPY(2018)
摘要
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 can achieve the minimum-bandwidth-regeneration (MBR) point of the achievable normalized storage-capacity repair-bandwidth trade-off 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.
更多查看译文
关键词
distributed storage,regenerating codes,multilevel diversity coding,information-theoretic security
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络