Repairable Fountain codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 1752-1756

  Asteris, Megasthenis ^a   Dimakis, Alexandros G ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; CODED SYMBOLS; DISTRIBUTED STORAGE SYSTEM; FINITE FIELDS; FOUNTAIN CODES; HIGH PROBABILITY; MATCHINGS; RANDOM MATRICES; RANDOM SUBSETS; STORAGE NODES;

INFORMATION THEORY; MULTIPROCESSING SYSTEMS;

FORWARD ERROR CORRECTION;

EID: 84867536064     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283579     Document Type: Conference Paper

References (13)

1. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," SIGCOMM Comput. Commun. Rev., vol. 28, pp. 56-67, October 1998. [Online]. Available: http://doi.acm.org/10.1145/285243.285258
2. M. Luby, "Lt codes," in Proceedings of the 43rd Symposium on Foundations of Computer Science, ser. FOCS '02. Washington, DC, USA: IEEE Computer Society, 2002, pp. 271-. [Online]. Available: http://dl.acm.org/ citation.cfm?id=645413.652135
3. A. Shokrollahi, "Raptor codes," IEEE/ACM Trans. Netw., vol. 14, pp. 2551-2567, June 2006. [Online]. Available: http://dx.doi.org/10.1109/TIT. 2006.874390
4. O. Khan, R. Burns, J. Plank, W. Pierce, and C. Huang, "Rethinking erasure codes for cloud file systems: Minimizing i/o for recovery and degraded reads," in Usenix Conference on File and Storage Technologies (FAST), 2012.
5. A. Dimakis, P. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," Information Theory, IEEE Transactions on, vol. 56, no. 9, pp. 4539 -4551, sept. 2010.
6. F. Oggier and A. Datta, "Self-repairing homomorphic codes for distributed storage systems," in INFOCOM, 2011 Proceedings IEEE, april 2011, pp. 1215-1223.
7. D. Papailiopoulos, J. Luo, A. Dimakis, C. Huang, and J. Li, "Simple regenerating codes: Network coding for cloud storage," Arxiv preprint arXiv:1109.0264, 2011.
8. P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, "On the locality of codeword symbols," Arxiv preprint arXiv:1106.3625, 2011.
9. P. Erdo{combining double acute accent}s and A. Rényi, "On random matrices," Publ. Math. Inst. Hungar. Acad. of Sciences. 8, 1964.
10. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Decentralized erasure codes for distributed networked storage," IEEE/ACM Trans. Netw., vol. 14, pp. 2809-2816, June 2006. [Online]. Available: http://dx.doi.org/10. 1109/TIT.2006.874535
11. R. Gummadi, "Coding and scheduling in networks for erasures and broadcast," Ph.D. dissertation, University of Illinois at Urbana-Champaign, 2011.
12. D. Wiedemann, "Solving sparse linear equations over finite fields," Information Theory, IEEE Transactions on, vol. 32, no. 1, pp. 54-62, jan 1986.
13. R. Motwani and P. Raghavan, "Algorithms and theory of computation handbook," M. J. Atallah and M. Blanton, Eds. Chapman & Hall/CRC, 2010, ch. Randomized algorithms, pp. 12-12. [Online]. Available: http://dl.acm.org/ citation.cfm?id=1882757.1882769