Matroid Theory and Storage Codes: Bounds and Constructions
Information Theory
2017-09-07 v2 Combinatorics
math.IT
Abstract
Recent research on distributed storage systems (DSSs) has revealed interesting connections between matroid theory and locally repairable codes (LRCs). The goal of this chapter is to introduce the reader to matroids and polymatroids, and illustrate their relation to distribute storage systems. While many of the results are rather technical in nature, effort is made to increase accessibility via simple examples. The chapter embeds all the essential features of LRCs, namely locality, availability, and hierarchy alongside with related generalised Singleton bounds.
Cite
@article{arxiv.1704.04007,
title = {Matroid Theory and Storage Codes: Bounds and Constructions},
author = {Ragnar Freij-Hollanti and Camilla Hollanti and Thomas Westerbäck},
journal= {arXiv preprint arXiv:1704.04007},
year = {2017}
}
Comments
Invited book chapter in Network Coding and Subspace Designs, Springer, to appear