Codes for distributed storage from 3-regular graphs

DOI10.1016/J.DAM.2017.04.014MaRDI QIDQ2012057zbMATH OpenOpenAlexFDO

Authors Shuhong Gao, Fiona Knoll, 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

3-regular graphs4-regular graphdecomposition of 3-regular graphsdistributed storage systemslinear codes from graphsP4 paths

Mathematics Subject Classification ID

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

Abstract: This paper considers distributed storage systems (DSSs) from a graph theoretic perspective. A DSS is constructed by means of the path decomposition of a 3- regular graph into P4 paths. The paths represent the disks of the DSS and the edges of the graph act as the blocks of storage. We deduce the properties of the DSS from a related graph and show their optimality.

Recommendations

• Bounds on generalized FR codes using hypergraphs
• Optimal fractional repetition codes based on graphs and designs
• Regular graphs with forbidden subgraphs of \(K_n\) with \(k\) edges
• Network Coding for Distributed Storage Systems
• scientific article; zbMATH DE number 2154518

Cites work

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

Cited in

(2)

• Johnson graph codes
• Storage codes and recoverable systems on lines and grids

Describes a project that uses

Uses Software

• Code Tables

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012057)