New Lower Bounds on File Size of Fractional Repetition Codes via Eigenvalues of Bipartite Graphs
Abstract
Fractional repetition codes (FRCs)/Generalized FRCs (GFRCs) are classes of minimum bandwidth regenerating codes that play a key role in distributed storage systems. In this paper, first, we explore the inherent connection between biregular bipartite graphs and FRCs/GFRCs. Using the structural characteristics of these graphs, we determine the lower bound of the file size of the FRCs/GFRCs related to these graphs. Specifically, we leverage the eigenvalues of biregular bipartite graphs and derive several lower bounds on the file size of FRCs/GFRCs with flexible parameters and reconstruction degrees.
Fields of Study & Subjects
Advanced Data Storage Technologies
Coding theory and cryptography
Error Correcting Code Techniques
Publication details
- Journal / source
- IEEE Transactions on Communications
- Volume
- 74
- Pages
- 4680–4693
- Publication date
- 1 January 2026
- Language
- EN