Construction of minimum bandwidth regenerating codes with combinatorial design

DOI10.1007/s11859-016-1164-7zbMath1363.94053OpenAlexW2507458272MaRDI QIDQ2825280

Wangmei Guo, Feng Cai

Publication date: 6 October 2016

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11859-016-1164-7

zbMATH Keywords

combinatorial designnetwork codingdistributed storage systemminimum bandwidth regenerating codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Cites Work

• An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
• Repair Optimal Erasure Codes Through Hadamard Designs
• Linear network coding
• Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
• Cooperative Regenerating Codes

This page was built for publication: Construction of minimum bandwidth regenerating codes with combinatorial design