Bounds on generalized FR codes using hypergraphs
type: Item
instance of: scholarly article
title: Bounds on generalized FR codes using hypergraphs
zbMATH Open document ID: 1501.94083
author: Krishna Gopal
author: M. K. Gupta
published in: Journal of Applied Mathematics and Computing
publication date: 2021-11-29T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 7435194
zbMATH Keywords: data storage system
zbMATH Keywords: codes for distributed computing
zbMATH Keywords: regenerating codes
zbMATH Keywords: distributed storage systems
zbMATH Keywords: fractional repetition code
zbMATH Keywords: coding for distributed storage
MaRDI profile type: Publication
full work available at URL: s12190-020-01414-8
OpenAlex ID: W3046020483
cites work: On non-uniform Flower codes
cites work: Minimax relations for the partial q-colorings of a graph
cites work: Hypergraph theory. An introduction
cites work: Network Coding for Distributed Storage Systems
cites work: Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
cites work: Fractional Repetition and Erasure Batch Codes
cites work: Optimal Fractional Repetition Codes Based on Graphs and Designs
cites work: Q4709177
DOI: 10.1007/S12190-020-01414-8
description: scientific article; zbMATH DE number 7435194