Codes for distributed storage from 3-regular graphs

DOI10.1016/j.dam.2017.04.014zbMath1367.05166arXiv1610.00043OpenAlexW2529153539MaRDI QIDQ2012057

Fiona Knoll, Shuhong Gao, Felice Manganiello, Gretchen L. Matthews

Publication date: 27 July 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.00043

zbMATH Keywords

4-regular graphdistributed storage systems3-regular graphsdecomposition of 3-regular graphslinear codes from graphsP4 paths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed systems (68M14)

Uses Software

• Code Tables

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs, networks and algorithms.
• Computational determination of (3,11) and (4,7) cages
• Dynamic cage survey
• A Family of Optimal Locally Recoverable Codes
• From the theory of regular graphs of third and fourth degree
• Trois Types De Décompositions D'un Graphe En Chaînes
• Regular path decompositions of odd regular graphs
• Cages—a survey
• P4-decompositions of regular graphs
• Network Coding for Distributed Storage Systems
• Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
• The smallest graph of girth 5 and valency 4

This page was built for publication: Codes for distributed storage from 3-regular graphs