Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1704.04007 (cs)
[Submitted on 13 Apr 2017 (v1), last revised 5 Sep 2017 (this version, v2)]

Title:Matroid Theory and Storage Codes: Bounds and Constructions

Authors:Ragnar Freij-Hollanti, Camilla Hollanti, Thomas Westerbäck
View PDF
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.
Comments: Invited book chapter in Network Coding and Subspace Designs, Springer, to appear
Subjects: Information Theory (cs.IT); Combinatorics (math.CO)
Cite as: arXiv:1704.04007 [cs.IT]
  (or arXiv:1704.04007v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1704.04007

Submission history

From: Thomas Westerbäck [view email]
[v1] Thu, 13 Apr 2017 06:34:54 UTC (49 KB)
[v2] Tue, 5 Sep 2017 20:52:42 UTC (51 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2017-04
Change to browse by:
cs
math
math.CO
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Ragnar Freij-Hollanti
Camilla Hollanti
Thomas Westerbäck
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)