On Universally Good Flower Codes
Krishna Gopal Benerjee, Manish K Gupta
TL;DR
This paper introduces a new method for constructing Fractional Repetition (FR) codes for distributed storage systems using finite binary sequences, and explores conditions for their universal goodness.
Contribution
It presents a novel construction of FR codes via finite binary sequences and determines the conditions under which these codes are universally good.
Findings
Conditions for universally good FR codes are derived.
Some binary sequences yield universally good FR codes.
The approach enhances the design of efficient distributed storage codes.
Abstract
For a Distributed Storage System (DSS), the \textit{Fractional Repetition} (FR) code is a class in which replicas of encoded data packets are stored on distributed chunk servers, where the encoding is done using the Maximum Distance Separable (MDS) code. The FR codes allow for exact uncoded repair with minimum repair bandwidth. In this paper, FR codes are constructed using finite binary sequences. The condition for universally good FR codes is calculated on such sequences. For some sequences, the universally good FR codes are explored.
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 · Caching and Content Delivery · Cooperative Communication and Network Coding