Local recovery properties of capacity achieving codes

2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings

Volumn , Issue , 2013, Pages 261-263

  Mazumdar, Arya ^a   Chandar, Venkat ^b   Wornell, Gregory W ^c  

^a University of Minnesota   (United States)

^b MIT LINCOLN LABORATORY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED STORAGE; ERROR-CORRECTING; LOCAL RECOVERIES; OPTIMAL CODES; RECOVERABILITY; STORAGE NODES; SYMMETRIC CHANNELS; UPPER AND LOWER BOUNDS;

DIGITAL STORAGE; INFORMATION THEORY; RECOVERY; REPAIR;

OPTIMAL SYSTEMS;

EID: 84877646093     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2013.6502958     Document Type: Conference Paper

References (11)

1. N. Alon, J. Spencer, The Probabilistic Method, Wiley-Interscience, 2000.
2. N. P. Anthapadmanabhan, E. Soljanin, S. Vishwanath, "Update- efficient codes for erasure correction," 48th Annual Allerton Conference on Communication, Control, and Computing, pp. 376-382, October, 2010.
3. V. Cadambe, A. Mazumdar, "Codes for distributed storage," draft, 2013.
4. V. Chandar, Sparse Graph Codes for Compression, Sensing, and Secrecy, Ph.D. Thesis, MIT, 2010.
5. T. Cover, J. Thomas, Elements of Information Theory, 2nd Ed., Wiley- Interscience, 2006.
6. R. G. Gallager, Low Density Parity Check Codes, Monograph, M.I.T. Press, 1963.
7. P. Gopalan, C. Huang, H. Simitci, S. Yekhanin, "On the locality of codeword symbols," Allerton, 2011.
8. S. Litsyn, V. Shevelev, "On ensembles of low-density parity-check codes: asymptotic distance distributions," IEEE Transactions on Information Theory, vol. 48, no. 4, pp. 887-908, April 2002. (Pubitemid 34474785)
9. A. Mazumdar, G. W. Wornell, V. Chandar, "Update efficient codes for error correction," IEEE International Symposium on Information Theory (ISIT), 2012, pp 1558-1562.
10. A. Montanari, E. Mossel, "Smooth compression, Gallager bound and nonlinear sparse-graph codes," in Proc. 2008 IEEE Intl. Symp. on Information Theory (ISIT '08), Piscataway, NJ: IEEE Press, 2008, pp. 2474-2478.
11. D. Papailiopoulos, A. G. Dimakis, "Locally repairable codes," IEEE International Symposium on Information Theory (ISIT), 2012, pp. 2771-2775.