Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point

Shuo Shao; Tie Liu; Chao Tian; Cong Shen

doi:10.3390/e20100751

Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point

Entropy (Basel). 2018 Sep 30;20(10):751. doi: 10.3390/e20100751.

Authors

Shuo Shao¹, Tie Liu², Chao Tian², Cong Shen³

Affiliations

¹ Department of Electrical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China.
² Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX 77843, USA.
³ Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei 230026, China.

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 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.

Keywords: distributed storage; information-theoretic security; multilevel diversity coding; regenerating codes.

Abstract

Grants and funding