Matroid Theory and Storage Codes: Bounds and Constructions

Autor:	Freij-Hollanti, Ragnar, Hollanti, Camilla, Westerbäck, Thomas
Rok vydání:	2017
Předmět:	Computer Science - Information Theory Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	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. Comment: Invited book chapter in Network Coding and Subspace Designs, Springer, to appear
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1704.04007 Zobrazit plný text záznamu View this record from Arxiv