On non-uniform Flower codes

DOI10.1007/S12095-020-00430-6MaRDI QIDQ2202904zbMATH OpenOpenAlexFDO

Authors K. G. Benerjee, M. K. Gupta

Publication date 30 September 2020

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12095-020-00430-6

zbMATH Keywords

sequencesfractional repetition codeFlower codeheterogeneous distributed storage systems

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Bounds on codes (94B65) Other types of codes (94B60)

Recommendations

• Optimal fractional repetition codes based on graphs and designs
• Bounds on generalized FR codes using hypergraphs
• Fractional Repetition Codes With Optimal Reconstruction Degree
• Fractional repetition and erasure batch codes
• Architecture-aware coding for distributed storage: repairable block failure resilient codes

Cites work

• Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
• Fractional Repetition Codes With Optimal Reconstruction Degree
• Network Coding for Distributed Storage Systems
• Optimal Pliable Fractional Repetition Codes That are Locally Recoverable: A Bipartite Graph Approach
• Optimal fractional repetition codes based on graphs and designs

Cited in

(4)

• On unordered codes
• Extension-based constructions of locally repairable fractional repetition codes
• Optimal fractional repetition codes based on graphs and designs
• Bounds on generalized FR codes using hypergraphs

This page was built for publication: On non-uniform Flower codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202904)