Update-efficiency and local repairability limits for capacity approaching codes

IEEE Journal on Selected Areas in Communications

Volumn 32, Issue 5, 2014, Pages 976-998

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b University of Minnesota   (United States)

^c MIT LINCOLN LABORATORY   (United States)

^d USA   (United States)

Author keywords

channel capacity; error correcting codes; linear codes; locally repairable codes; low density generator matrix codes; low density parity check codes; update efficiency

Indexed keywords

CHANNEL CAPACITY; EFFICIENCY; OPTIMAL SYSTEMS;

ERROR CORRECTING CODE; LINEAR CODES; LOCALLY REPAIRABLE CODES; LOW-DENSITY GENERATOR MATRIX CODES; LOW-DENSITY PARITY-CHECK CODES; UPDATE-EFFICIENCY;

STORAGE ALLOCATION (COMPUTER);

EID: 84899808970     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2014.140517     Document Type: Article

References (36)

1. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4539-4551, Sep. 2010.
2. A. S. Rawat, S. Vishwanath, A. Bhowmick, and E. Soljanin, "Update efficient codes for distributed storage," in Proc. Int. Symp. Inform. Theory, St. Petersburg, Russia, July 2011, pp. 1457-1461.
3. L. Xu and J. Bruck, "X-code: MDS array codes with optimal encoding," IEEE Trans. Inf. Theory, vol. 45, no. 1, pp. 272-276, Jan. 1999.
4. C. Jin, H. Jiang, D. Feng, and L. Tian, "P-Code: A new RAID-6 code with optimal properties," in Proc. ACM Int. Conf. Supercomputing, 2009, pp. 360-369.
5. N. P. Anthapadmanabhan, E. Soljanin, and S. Vishwanath, "Updateefficient codes for erasure correction," in Proc. Allerton Conf. Commun., Contr., Computing, Monticello, IL, Oct. 2010, pp. 376-382.
6. P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, "On the locality of codeword symbols," IEEE Trans. Inf. Theory, vol. 58, no. 11, pp. 6925-6934, Nov. 2012.
7. D. S. Papailiopoulos and A. G. Dimakis, "Locally repairable codes," in Proc. Int. Symp. Inform. Theory, Cambridge, MA, July 2012, pp. 2771-2775.
8. V. Cadambe and A. Mazumdar, "An upper bound on the size of locally recoverable codes," in Proc. IEEE Int. Symp. Network Coding, 2013.
9. G. M. Kamath, N. Prakash, V. Lalitha, P. V. Kumar, N. Silberstein, A. S. Rawat, O. O. Koyluoglu, and S. Vishwanath, "Explicit MBR all-symbol locality codes," 2013, preprint, arXiv:1302.0744.
10. A. S. Rawat, O. O. Koyluoglu, N. Silberstein, and S. Vishwanath, "Optimal locally repairable and secure codes for distributed storage systems," 2012, preprint, arXiv:1210.6954.
11. I. Tamo, D. S. Papailiopoulos, and A. G. Dimakis, "Optimal locally repairable codes and connections to matroid theory," 2013, preprint, arXiv:1301.7693.
12. A. Montanari and E. Mossel, "Smooth compression, Gallager bound and nonlinear sparse-graph codes," in Proc. Int. Symp. Inform. Theory, Toronto, Canada, July 2008, pp. 2474-2478.
13. V. B. Chandar, "Sparse graph codes for compression, sensing, and secrecy," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, 2010.
14. S. M. Dodunekov and N. L. Manev, "An improvement of the Griesmer bound for some small minimum distances," Discrete Applied Mathematics, vol. 12, no. 2, pp. 103-114, Dec. 1985. (Pubitemid 15583521)
15. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. North-Holland, 1997.
16. B. I. Belov, V. N. Logachev, and V. P. Sandimirov, "Construction of a class of linear binary codes achieving the Varshamov-Griesmer bound," Problemy Peredachi Informatsii, vol. 10, no. 3, pp. 36-44, 1974.
17. T. Helleseth, "New constructions of codes meeting the Griesmer bound," IEEE Trans. Inf. Theory, vol. 29, no. 3, pp. 434-439, Mar. 1983. (Pubitemid 13544552)
18. J. Simonis, "On generator matrices of codes," IEEE Trans. Inf. Theory, vol. 38, no. 2, p. 516, Feb. 1992.
19. W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes. Cambridge University Press, 2003.
20. E. Grigorescu and T. Kaufman, "Explicit low-weight bases for BCH codes," IEEE Trans. Inf. Theory, vol. 58, no. 1, pp. 78-81, Jan. 2012.
21. M. Langberg, "Private codes or succinct random codes that are (almost) perfect," in Proc. Conf. Found. Comp. Sci. (FOCS), vol. 4, 2004, pp. 325-334. (Pubitemid 40575294)
22. R. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962.
23. A. M. Kakhaki, H. K. Abadi, P. Pad, H. Saeedi, F. Marvasti, and K. Alishahi, "Capacity achieving linear codes with binary sparse generating matrices," 2011, preprint, arXiv:1102.4099.
24. M. Asteris and A. G. Dimakis, "Repairable fountain codes," in Proc. Int. Symp. Inform. Theory, Cambridge, MA, July 2012, pp. 1752-1756.
25. A. Mazumdar, G. W. Wornell, and V. Chandar, "Update efficient codes for error correction," in Proc. Int. Symp. Inform. Theory, Cambridge, MA, July 2012, pp. 1558-1562.
26. A. Barg and G. D. Forney Jr., "Random codes: Minimum distances and error exponents," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2568-2573, Sep. 2002. (Pubitemid 35032681)
27. G. Miller and D. Burshtein, "Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2696-2710, July 2001. (Pubitemid 33053477)
28. N. Alon and J. H. Spencer, The Probabilistic Method. NewYork, NY: Wiley, 2004.
29. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY: Wiley-interscience, 2012.
30. N. J. Calkin, "Dependent sets of constant weight binary vectors," Combinatorics, Probability, Computing, vol. 6, no. 3, pp. 263-271, 1997. (Pubitemid 127479626)
31. S. M. Johnson, "A new upper bound for error-correcting codes," IRE Trans. Inform. Theory, vol. 8, no. 4, pp. 203-207, Apr. 1962.
32. Y. Kochman, A. Mazumdar, and Y. Polyanskiy, "The adversarial joint source-channel problem," in Proc. Int. Symp. Inform. Theory, Cambridge, MA, July 2012, pp. 2112-2116.
33. M. J. Wainwright, E. Maneva, and E. Martinian, "Lossy source compression using low-density generator matrix codes: Analysis and algorithms," IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1351-1368, Mar. 2010.
34. Z. Zhang, E.-H. Yang, and V. K. Wei, "The redundancy of source coding with a fidelity criterion I: Known statistics," IEEE Trans. Inf. Theory, vol. 43, no. 1, pp. 71-91, Jan. 1997. (Pubitemid 127826381)
35. R. M. Roth, Introduction to Coding Theory. Cambridge University Press, 2006.
36. E. Hof, I. Sason, and S. Shamai, "Performance bounds for nonbinary linear block codes over memoryless symmetric channels," IEEE Trans. Inf. Theory, vol. 55, no. 3, pp. 977-996, Mar. 2009.