Symmetry in distributed storage systems
Date
2013
Authors
Thakor, S.
Chan, T.
Shum, K.W.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
IEEE International Symposium on Information Theory - Proceedings, 2013, pp.1242-1246
Statement of Responsibility
Conference Name
ISIT 2013 : 2013 IEEE International Symposium on Information Theory (7 Jul 2013 - 12 Jul 2013 : Istanbul, Turkey)
Abstract
The max-flow outer bound is achievable by regenerating codes for functional repair distributed storage system. However, the capacity of exact repair distributed storage system is an open problem. In this paper, the linear programming bound for exact repair distributed storage systems is formulated. A notion of symmetrical sets for a set of random variables is given and equalities of joint entropies for certain subsets of random variables in a symmetrical set is established. Concatenation coding scheme for exact repair distributed storage systems is proposed and it is shown that concatenation coding scheme is sufficient to achieve any admissible rate for any exact repair distributed storage system. Equalities of certain joint entropies of random variables induced by concatenation scheme is shown. These equalities of joint entropies are new tools to simplify the linear programming bound and to obtain stronger converse results for exact repair distributed storage systems.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2013 IEEE