Publisher
Springer Science and Business Media LLC
Reference5 articles.
1. Liang S T, Liang W J, Kan H B. Construction of one special minimum storage regenerating code when α = 2. Sci China Inf Sci, 2015, 58: 062308
2. Kan H B, Liu X D, Han G Y. On the criteria for designing complex orthogonal space-time block codes. Sci China Inf Sci, 2016, 59: 082303
3. Balaji S B, Vijay Kumar P. Bounds on the rate and minimum distance of codes with availability. In: Proceedings of IEEE International Symposium on Information Theory, Aachen, 2017. 3155–3159
4. Rawat A S, Papailiopoulos D S, Dimakis A G, et al. Locality and availability in distributed storage. IEEE Trans Inform Theor, 2016, 62: 4481–4493
5. Wang A Y, Zhang Z F. Repair locality with multiple erasure tolerance. IEEE Trans Inform Theor, 2014, 60: 6979–6987
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two families of LRCs with availability based on iterative matrix;2020 13th International Symposium on Computational Intelligence and Design (ISCID);2020-12
2. A New Construction of Optimal (r, δ) Locally Recoverable Codes;IEEE Communications Letters;2020-09
3. Locally repairable codes from combinatorial designs;Science China Information Sciences;2020-01-15