Construction of minimum bandwidth regenerating codes with combinatorial design
From MaRDI portal
Publication:2825280
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
Cites work
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)