Extremal regular graphs and hypergraphs related to fractional repetition codes

DOI10.1007/S10623-024-01370-5MaRDI QIDQ6564084zbMATH OpenFDO

Authors Hongna Yang, YiWei Wang, Yiwei Zhang

Publication date 28 June 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

extremal graph theorydistributed storage systemcage graphsfractional repetition codes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial codes (94B25) Bounds on codes (94B65)

Recommendations

• Optimal fractional repetition codes based on graphs and designs
• Bounds on generalized FR codes using hypergraphs
• Fractional Repetition Codes With Optimal Reconstruction Degree
• Regular graphs with forbidden subgraphs of \(K_n\) with \(k\) edges
• Fractional repetition and erasure batch codes

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• A linear hypergraph extension of Turán's theorem
• Codes for Distributed Storage
• Connectivity of cages
• Dynamic cage survey
• Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
• Network Coding for Distributed Storage Systems
• On Moore Graphs with Diameters 2 and 3
• On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
• On regular hypergraphs of high girth
• Optimal fractional repetition codes based on graphs and designs
• Rack-Aware Regenerating Codes for Data Centers
• Regular graphs with forbidden subgraphs of \(K_n\) with \(k\) edges
• The CRC handbook of combinatorial designs
• The smallest graph of girth 5 and valency 4
• Turán numbers of bipartite graphs plus an odd cycle

Cited in

(1)

• Construction of storage codes of rate approaching one on triangle-free graphs

This page was built for publication: Extremal regular graphs and hypergraphs related to fractional repetition codes

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