Optimal Fractional Repetition Codes Based on Graphs and Designs
From MaRDI portal
Publication:2977323
DOI10.1109/TIT.2015.2442231zbMath1359.94816arXiv1401.4734OpenAlexW2964259813MaRDI QIDQ2977323
Tuvi Etzion, Natalia Silberstein
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.4734
Related Items (9)
MaxMinSum Steiner Systems for Access Balancing in Distributed Storage ⋮ Fractional Repetition and Erasure Batch Codes ⋮ On the maximum double independence number of Steiner triple systems ⋮ On non-uniform Flower codes ⋮ Access balancing in storage systems by labeling partial Steiner systems ⋮ Architecture-aware coding for distributed storage: repairable block failure resilient codes ⋮ Bounds on generalized FR codes using hypergraphs ⋮ Functional repair codes: a view from projective geometry ⋮ Codes for Distributed Storage
This page was built for publication: Optimal Fractional Repetition Codes Based on Graphs and Designs