Bounds on generalized FR codes using hypergraphs

DOI10.1007/S12190-020-01414-8zbMath1501.94083OpenAlexW3046020483MaRDI QIDQ2053179

Krishna Gopal, Manish K. Gupta

Publication date: 29 November 2021

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-020-01414-8

zbMATH Keywords

regenerating codesdistributed storage systemscodes for distributed computingcoding for distributed storagedata storage systemfractional repetition code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Other types of codes (94B60)

Cites Work

• Unnamed Item
• Minimax relations for the partial q-colorings of a graph
• Hypergraph theory. An introduction
• On non-uniform Flower codes
• Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
• Optimal Fractional Repetition Codes Based on Graphs and Designs
• Fractional Repetition and Erasure Batch Codes
• Network Coding for Distributed Storage Systems

This page was built for publication: Bounds on generalized FR codes using hypergraphs