Applications of polymatroid theory to distributed storage systems

Loading...
Thumbnail Image

Access rights

openAccess

URL

Journal Title

Journal ISSN

Volume Title

A4 Artikkeli konferenssijulkaisussa

Date

2016-04-04

Major/Subject

Mcode

Degree programme

Language

en

Pages

7
231-237

Series

2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015

Abstract

In this paper, a link between polymatroid theory and locally repairable codes (LRCs) is established. The codes considered here are completely general in that they are subsets of An, where A is an arbitrary finite set. Three classes of LRCs are considered, both with and without availability, and for both information-symbol and all-symbol locality. The parameters and classes of LRCs are generalized to polymatroids, and a generalized Singelton bound on the parameters for these three classes of polymatroids and LRCs is given. This result generalizes the earlier Singleton-type bounds given for LRCs. Codes achieving these bounds are coined perfect, as opposed to the more common term optimal used earlier, since they might not always exist. Finally, new constructions of perfect linear LRCs are derived from gammoids, which are a special class of matroids. Matroids, for their part, form a subclass of polymatroids and have proven useful in analyzing and constructing linear LRCs.

Description

Keywords

Other note

Citation

Westerbäck, T, Freij-Hollanti, R & Hollanti, C 2016, Applications of polymatroid theory to distributed storage systems . in 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 ., 7447009, IEEE, pp. 231-237, Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, United States, 29/09/2015 . https://doi.org/10.1109/ALLERTON.2015.7447009