Construction of one special minimum storage regenerating code when α=2-Reference-Cited by-同舟云学术

Construction of one special minimum storage regenerating code when α=2

Published:2015-04-15 Issue:6 Volume:58 Page:1-10
ISSN:1674-733X
Container-title:Science China Information Sciences
language:en
Short-container-title:Sci. China Inf. Sci.

Author:

Liang SongTao,Liang WenJuan,Kan HaiBin

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s11432-014-5274-6.pdf

Reference21 articles.

1. Dimakis A G, Godfrey P B, Wu Y, et al. Network coding for distributed storage systems. IEEE Trans Inf Theory, 2010, 56: 4539–4551

2. Shah N B, Rashmi K V, Vijay Kumar P, et al. Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff. IEEE Trans Inf Theory, 2012, 58: 1837–1852

3. Oggier F, Datta A. Self-repairing homomorphic codes for distributed storage systems. In: Proceedings of the IEEE International Conference on Computer Communications(INFOCOM), Shanghai, 2011. 1215–1223

4. Shah N B, Rashmi K V, Vijay Kumar P. A flexible class of regenerating codes for distributed storage. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), Austin, 2010. 1943–1947

5. Shum K W. Cooperative regenerating codes for distributed storage systems. In: Proceedings of IEEE International Conference (ICC), Kyoto, 2011. 1–5

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Locally repairable codes from combinatorial designs;Science China Information Sciences;2020-01-15

2. Locally repairable codes with strict availability from linear functions;Science China Information Sciences;2018-08-16

3. A New Construction of Exact-Repair MSR Codes Using Linearly Dependent Vectors;IEEE Communications Letters;2017-08