Browse > Article
http://dx.doi.org/10.7840/kics.2016.41.12.1671

Locally Repairable Codes with Two Different Locality Requirements  

Kim, Geonu (Department of Electrical and Computer Engineering, INMAC, Seoul National University)
Lee, Jungwoo (Department of Electrical and Computer Engineering, INMAC, Seoul National University)
Abstract
Locally repairable codes (LRCs) constitute an important class of codes for distributed storage, where repair efficiency is a key metric of system performance. In LRCs, efficient repair is achieved by small locality-number of nodes participating in the repair process. In this paper, we focus on situations where different locality is required for different nodes. We present a non-trivial extension of the recent results on multiple (or unequal) localities to the $r,{\delta}$-locality case. A new Singleton-type minimum distance upper bound is derived and an optimal code construction is provided. While the result is limited to the case of only two different localities, it should be noted that it can be directly applied to the more general case where the localities are specified not exactly but by upper limits.
Keywords
Distributed Storage; Locality; LRC; Singleton Bound; Gabidulin Code;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 J.-C. Park, "Improving data availability by data partitioning and partial overlapping on multiple cloud storages," J. KICS, vol. 36, no. 12, pp. 1498-1508, Dec. 2011.   DOI
2 M. Sathiamoorthy, M. Asteris, D. Papailiopoulos, A. G. Dimakis, R. Vadali, S. Chen, and D. Borthakur, "Xoring elephants: novel erasure codes for big data," in Proc. Int. Conf. Very Large Data Bases, pp. 325-336, Trento, Italy, Aug. 2013.
3 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, Sept. 2010.   DOI
4 J. S. Park, J.-H. Kim, K.-H. Park, and H.-Y Song, "Average repair read cost of linear repairable code ensembles," J. KICS, vol. 39, no. 11, pp. 723-729, Nov. 2014.
5 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.   DOI
6 J.-H. Kim, M.-Y. Nam, K.-H. Park, and H.-Y Song, "Construction of ($2^k-1+k,k,2^{k-1}+1$) codes attaining Griesmer bound and its locality," J. KICS, vol. 40, no. 3, pp. 491-496, Mar. 2015.   DOI
7 N. Prakash, G. M. Kamath, V. Lalitha, and P. V. Kumar, "Optimal linear codes with a local-error-correction property," in IEEE ISIT, pp. 2776-2780, Cambridge, MA, Jul. 2012.
8 G. M. Kamath, N. Prakash, V. Lalitha, and P. V. Kumar, "Codes with local regeneration and erasure correction," IEEE Trans. Inf. Theory, vol. 60, no. 8, pp. 4637-4660, Aug. 2014.   DOI
9 A. Zeh and E. Yaakobi, "Bounds and constructions of codes with multiple localities," in 2016 IEEE ISIT, pp. 640-644, Barcelona, Spain, Jul. 2016.
10 S. Kadhe and A. Sprintson, "Codes with unequal locality," in 2016 IEEE ISIT, pp. 435-439, Barcelona, Spain, Jul. 2016.
11 M. Kuijper and D. Napp, Erasure codes with simplex locality, CoRR, vol. abs/1403.2779, 2014, [Online]. Available: http://arxiv.org/abs/1403.2779
12 N. Silberstein, A. S. Rawat, O. O. Koyluoglu, and S. Vishwanath, "Optimal locally repairable codes via rank-metric codes," in IEEEISIT, pp. 1819-1823, Istanbul, Turkey, Jul. 2013.
13 A. S. Rawat, O. O. Koyluoglu, N. Silberstein, and S. Vishwanath, "Optimal locally repairable and secure codes for distributed storage systems," IEEE Trans. Inf. Theory, vol. 60, no. 1, pp. 212-236, Jan. 2014.   DOI
14 E. M. Gabidulin, "Theory of codes with maximum rank distance," Problems of Inf. Transmission, vol. 21, no. 1, pp. 3-16, Jan. 1985.
15 F. MacWilliams and N. Sloane, The Theory of Error Correcting Codes, North-Holland Publishing Company, 1977.
16 G. Kim and J. Lee, "A study on ($r,{\delta}$)-LRC with two localities," in Proc. KICS Int. Conf. Commun., pp. 465-466, Jeju, Korea, Jun. 2016.