Extremal regular graphs and hypergraphs related to fractional repetition codes
From MaRDI portal
Publication:6564084
DOI10.1007/S10623-024-01370-5MaRDI QIDQ6564084FDOQ6564084
Authors: Hongna Yang, YiWei Wang, Yiwei Zhang 
Publication date: 28 June 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- The CRC handbook of combinatorial designs
- Network Coding for Distributed Storage Systems
- On Moore Graphs with Diameters 2 and 3
- On regular hypergraphs of high girth
- Dynamic cage survey
- A linear hypergraph extension of Turán's theorem
- Turán numbers of bipartite graphs plus an odd cycle
- The smallest graph of girth 5 and valency 4
- Connectivity of cages
- Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
- Regular graphs with forbidden subgraphs of \(K_n\) with \(k\) edges
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
- Optimal fractional repetition codes based on graphs and designs
- Codes for Distributed Storage
- Rack-Aware Regenerating Codes for Data Centers
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)
