Construction of one special minimum storage regenerating code when α=2
From MaRDI portal
Publication:5046472
DOI10.1007/S11432-014-5274-6zbMATH Open1497.94186OpenAlexW2186819207MaRDI QIDQ5046472FDOQ5046472
Authors: Songtao Liang, Wenjuan Liang, Haibin Kan 
Publication date: 28 October 2022
Published in: Science China Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-014-5274-6
Cites Work
- Network Coding for Distributed Storage Systems
- Cooperative Regenerating Codes
- Title not available (Why is that?)
- Explicit-form complex orthogonal design for space-time block codes
- A construction method of matroidal networks
- A new scheme of digital communication using chaotic signals in MIMO channels
- A characterization of solvability for a class of networks
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
This page was built for publication: Construction of one special minimum storage regenerating code when α=2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5046472)
