Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point.
- Additional Document Info
- View All
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.
author list (cited authors)
Shao, S., Liu, T., Tian, C., & Shen, C.
complete list of authors
Shao, Shuo||Liu, Tie||Tian, Chao||Shen, Cong