Fractional Repetition and Erasure Batch Codes
From MaRDI portal
Publication:3460483
DOI10.1007/978-3-319-17296-5_36zbMath1344.94103arXiv1405.6157OpenAlexW2963389365MaRDI QIDQ3460483
Publication date: 7 January 2016
Published in: Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6157
Extremal set theory (05D05) Other designs, configurations (05B30) Other types of codes (94B60) Information storage and retrieval of data (68P20)
Related Items (5)
Erasure combinatorial batch codes based on nonadaptive group testing ⋮ On erasure combinatorial batch codes ⋮ Multiset combinatorial batch codes ⋮ Bounds on generalized FR codes using hypergraphs ⋮ Functional repair codes: a view from projective geometry
Cites Work
- Unnamed Item
- Combinatorial batch codes: a lower bound and optimal constructions
- Optimal batch codes: many items or low retrieval requirement
- Combinatorial batch codes
- Optimal Fractional Repetition Codes Based on Graphs and Designs
- Batch codes and their applications
- Network Coding for Distributed Storage Systems
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
This page was built for publication: Fractional Repetition and Erasure Batch Codes