Construction of minimum bandwidth regenerating codes with combinatorial design

DOI10.1007/S11859-016-1164-7zbMATH Open1363.94053OpenAlexW2507458272MaRDI QIDQ2825280FDOQ2825280

Authors: Feng Cai, Wangmei Guo 

Publication date: 6 October 2016

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

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

Recommendations

• Study of minimum bandwidth regeneration codes based on Cauchy matrix
• Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields
• A Systematic Piggybacking Design for Minimum Storage Regenerating Codes
• A Framework of Constructions of Minimal Storage Regenerating Codes With the Optimal Access/Update Property
• Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
• A systematic approach to the construction of bandwidth-efficient multidimensional trellis codes
• A construction of maximally recoverable codes
• A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes
• A Method for the Construction of Minimum-Redundancy Codes
• Combinatorial Constructions of Optimal Constant-Composition Codes

zbMATH Keywords

network codingcombinatorial designdistributed storage systemminimum bandwidth regenerating codes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• A class of minimum storage cooperative regenerating codes with low access property
• Study of minimum bandwidth regeneration codes based on Cauchy matrix
• Repairing multiple failures for algebraic geometry codes
• A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes
• MDS code constructions with small sub-packetization and near-optimal repair bandwidth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2825280)