Network Coding for Distributed Storage Systems

From MaRDI portal
Revision as of 08:52, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4968711

DOI10.1109/TIT.2010.2054295zbMath1410.68117DBLPjournals/tit/DimakisGWWR10arXiv0803.0632WikidataQ56474330 ScholiaQ56474330MaRDI QIDQ4968711

Alexandros G. Dimakis, Kannan Ramchandran, P. Brighten Godfrey, Yunnan Wu, Martin J. Wainwright

Publication date: 8 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.0632




Related Items (36)

Construction of one special minimum storage regenerating code when α=2MaxMinSum Steiner Systems for Access Balancing in Distributed StorageLinear Batch CodesFractional Repetition and Erasure Batch CodesDD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of RetrievabilityLinear programming bounds for distributed storage codesA survey and refinement of repairable threshold schemesMax-flow min-cut theorems on dispersion and entropy measures for communication networksRecovery of quantum information from a node failure in a graphFractional decoding of \(r\)-Hermitian codesCorrecting adversarial errors with generalized regenerating codesA survey on GANs for computer vision: recent research, analysis and taxonomyCombinatorial repairability for threshold schemesA class of minimum storage cooperative regenerating codes with low access propertyMultilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix constructionOn additive MDS codes with linear projectionsAnticode-based locally repairable codes with high availabilityA characterization of optimal constacyclic locally repairable codesA new hybrid coding scheme: homomorphic minimum bandwidth repairing codesOn non-uniform Flower codesGalois geometries and coding theoryAC-RRNS: anti-collusion secured data sharing scheme for cloud storageUniversal secure rank-metric coding schemes with optimal communication overheadsMultilinear Algebra for Distributed StorageCodes for distributed storage from 3-regular graphsTrade-off for heterogeneous distributed storage systems between storage and repair costArchitecture-aware coding for distributed storage: repairable block failure resilient codesA new minimize matrix computation coding method for distributed storage systemsNetwork Coding for Distributed Storage SystemsBounds on generalized FR codes using hypergraphsFunctional repair codes: a view from projective geometryA new piggybacking design for systematic MDS storage codesSelf-repairing codesJohnson graph codesCodes for Distributed StorageA study of the performance of novel storage-centric repairable codes



Cites Work




This page was built for publication: Network Coding for Distributed Storage Systems