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

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.

authors

• Tian, Chao

published proceedings

• Entropy (Basel)

altmetric score

• 1.5

author list (cited authors)

• Shao, S., Liu, T., Tian, C., & Shen, C.

citation count

• 1

complete list of authors

• Shao, Shuo||Liu, Tie||Tian, Chao||Shen, Cong

publication date

• January 2018

publisher

• MDPI  Publisher

published in

• Entropy  Journal

keywords

• Distributed Storage
• Information-theoretic Security
• Multilevel Diversity Coding
• Regenerating Codes

Digital Object Identifier (DOI)

• 10.3390/e20100751

start page

• 751

end page

• 751

volume

• 20

issue

• 10

URL

• http://dx.doi.org/10.3390/e20100751