On Code Rates of Fractional Repetition Codes
Krishna Gopal Benerjee, Manish K Gupta
TL;DR
This paper investigates the limits of data storage efficiency in distributed systems using fractional repetition codes, providing bounds and identifying optimal codes through matrix representations.
Contribution
It introduces bounds on code rates for non-uniform fractional repetition codes and constructs universally good codes using matrix methods.
Findings
Derived bounds on FR code rate and DSS code rate.
Constructed universally good FR codes.
Analyzed non-uniform FR code properties.
Abstract
In \textit{Distributed Storage Systems} (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of \textit{Fractional Repetition} (FR) codes have been introduced, in which, data is replicated in a smart way on distributed servers using a \textit{Maximum Distance Separable} (MDS) code. In this work, for a non-uniform FR code, bounds on the FR code rate and DSS code rate are studied. Using matrix representation of an FR code, some universally good FR codes have been obtained.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cellular Automata and Applications · Coding theory and cryptography