On Dress Codes with Flowers
Krishna Gopal Benerjee, Manish K. Gupta
TL;DR
This paper introduces Flower codes, a novel sequence-based class of Fractional Repetition codes for distributed storage, offering an elegant alternative to combinatorial and graph-based constructions.
Contribution
It proposes a new sequence-based construction method for FR codes, specifically introducing and analyzing the properties of Flower codes.
Findings
Flower codes are a new class of FR codes with desirable properties.
Sequence-based approach simplifies code construction.
Potential for improved storage efficiency and reliability.
Abstract
Fractional Repetition (FR) codes are well known class of Distributed Replication-based Simple Storage (Dress) codes for the Distributed Storage Systems (DSSs). In such systems, the replicas of data packets encoded by Maximum Distance Separable (MDS) code, are stored on distributed nodes. Most of the available constructions for the FR codes are based on combinatorial designs and Graph theory. In this work, we propose an elegant sequence based approach for the construction of the FR code. In particular, we propose a beautiful class of codes known as Flower codes and study its basic properties.
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.