An inter-block 4-erasure-correcting scheme for reliable transmission of large data blocks
暂无分享,去创建一个
[1] Michael Mitzenmacher,et al. A digital fountain approach to asynchronous reliable multicast , 2002, IEEE J. Sel. Areas Commun..
[2] G.-L. Feng,et al. New efficient MDS array codes for RAID. Part II. Rabin-like codes for tolerating multiple (/spl ges/ 4) disk failures , 2005, IEEE Transactions on Computers.
[3] Lihao Xu,et al. Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications , 2006, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06).
[4] Miguel Castro,et al. SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.
[5] Jérôme Lacan,et al. Systematic MDS erasure codes based on Vandermonde matrices , 2004, IEEE Communications Letters.
[6] H DengRobert,et al. New Efficient MDS Array Codes for RAID Part II , 2005 .
[7] Michael Luby,et al. A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.
[8] Jacek Ilow,et al. Packet loss recovery codes based on Vandermonde matrices and shift operators , 2008, 2008 IEEE International Symposium on Information Theory.
[9] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[10] Robert H. Deng,et al. New efficient MDS array codes for RAID. Part I. Reed-Solomon-like codes for tolerating three disk failures , 2005, IEEE Transactions on Computers.