参考文献
[ 1 ] Dimakis A G,Ramchandran K,Wu Y,et al. A Survey
on Network Codes for Distributed Storage [ J ].
Proceedings of the IEEE,2011,99(3):476-489.
[ 2 ] Dimakis A G, Godfrey P G, Wu Y, et al. Network
Coding for Distributed Storage Systems [ J ]. IEEE
Transactions on Information Theory, 2010, 56 ( 9 ):
4539-4551.
[ 3 ] 卢开澄,卢华明. 图论及其应用[M]. 北京:清华大学
出版社,2005.
[ 4 ] Wu Y, Dimakis A G, Ramchandran K. Deterministic
Regenerating Codes for Distributed Storage [C ]/ / Proceedings
of the 45th Annual Allenton Conference on Communication,
Control, and Computing. Washington D. C., USA:IEEE Press,2007:2276-2280.
[ 5 ] Wu Y,Dimakis A G. Reducing Repair Traffic for Erasure
Coding-based Storage via Interference Alignment [C]/ /
Proceedings of IEEE International Symposium on Information
Theory. Washington D. C.,USA:IEEE Press,2009:
2267-2280.
[ 6 ] Suh C,Ramchandran K. Exact Regeneration Codes for
Distributed Storage Repair Using Interference Alignment[
C]/ / Proceedings of IEEE International Symposium
on Information Theory Proceedings. Washington D. C., USA:IEEE Press,2010.
[ 7 ] Shah N B,Rashmi K V,Kumar P V,et al. Interference
Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions [J]. IEEE Transactions
on Information Theory,2012,58(4):2134-2158.
[ 8 ] Yeung R W,Li Y R, Cai N, et al. Network Coding
Theory[M]. Boston,USA:Now Publishers Inc. ,2006.
[ 9 ] Gaston B,Pujol J,Villanueva M. Quasi-cyclic Minimum
Storage Regenerating Codes for Distributed Data
Compression [ C ] / / Proceedings of Data Compression
Conference. Washington D. C.,USA:IEEE Press,2011:
33-42.
[10] Gaston B,Pujol J,Villanueva M. Quasi-cyclic Flexible
Regenerating Codes [EB / OL]. (2012-12-13). http:/ /
arxiv. org / licenses / nonexclusive-distrib / 1. 0/ .
[11] Kan Haibin,Shen Hong. Lower Bounds of the Minimal
Delays of Complex Orthogonal Designs with Maximal
Rates[J]. IEEE Transactions on Communications,2006,
54(3):383-388.
[12] Kan Haibin,Shen Hong. A Relation Between the Characteristic
Generators of a Linear Code and Its Dual [J].
IEEE Transactions on Information Theory,2005,51(3):
1199-1202.
[13] Yuan C,Kan Haibin. A Characterization of Solvability
for a Kind of Networks[J]. Science China Information
Sciences,2012,55(4):747-754.
编辑 陆燕菲 |