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

Construction of [2k-1+k, k, 2k-1+1] Codes Attaining Griesmer Bound and Its Locality  

Kim, Jung-Hyun (School of Electrical and Electronic Engineering, Yonsei University)
Nam, Mi-Young (School of Electrical and Electronic Engineering, Yonsei University)
Park, Ki-Hyeon (School of Electrical and Electronic Engineering, Yonsei University)
Song, Hong-Yeop (School of Electrical and Electronic Engineering, Yonsei University)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.40, no.3, 2015 , pp. 491-496 More about this Journal
Abstract
In this paper, we introduce two classes of optimal codes, [$2^k-1$, k, $2^{k-1}$] simplex codes and [$2^k-1+k$, k, $2^{k-1}+1$] codes, attaining Griesmer bound with equality. We further present and compare the locality of them. The [$2^k-1+k$, k, $2^{k-1}+1$] codes have good locality property as well as optimal code length with given code dimension and minimum distance. Therefore, we expect that [$2^k-1+k$, k, $2^{k-1}+1$] codes can be applied to various distributed storage systems.
Keywords
Distributed Storage Systems; Locality; Locally Repairable Codes; Griesmer Bound; Optimal Codes;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 D. S. Papailiopoulos and A. G. Dimakis, "Locally repairable codes," IEEE Trans. Inf. Theory, vol. 60, no. 10, pp. 5843-5855, Oct. 2014.   DOI   ScienceOn
2 V. Cadambe and A. Mazumdar, "An upper bound on the size of locally recoverable codes," in Proc. IEEE Int. Symp. Netw. Coding, pp. 1-5, Calgary, Canada, Jun. 2013.
3 C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin, "Erasure coding in Windows Azure Storage," in Proc. 2012 USENIX Annu. Technical Conf., pp. 1-12, Boston, USA, Jun. 2012.
4 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. 39th Int. Conf. Very Large Data Bases, vol. 6, no. 5, pp. 325-336, Trento, Italy, Aug. 2013.
5 M. Kuijper and D. Napp, Erasure codes with simplex locality(2014), Last access(Feb. 16, 2015), http://arxiv.org/abs/1403.2779.
6 J. H. Griesmer, "A bound for error-correcting codes," IBM J. Res. Develop., vol. 4, pp. 532-542, Nov. 1960.   DOI
7 W. C. Huffman and V. Pless, Fundamentals of error correcting codes, Cambridge, 2003.
8 J.-H. Kim and H.-Y. Song, "Simple construction of [$2^k-1+k,\;k,\;2^{k-1}+1$] code attaining the Griesmer bound," in Proc. 9th Joint Conf. Commun. & Inf., pp. 420-422, Icheon, Korea, Apr. 1999.
9 T. Helleseth, "New constructions of codes meeting the Griesmer bound," IEEE Trans. Inf. Theory, vol. 29, no. 3, pp. 434-439, Mar. 1983.   DOI
10 M. N. Krishnan, N. Prakash, V. Lalitha, B. Sasidharan, P. V. Kumar, S. Narayanamurthy, R. Kumar, and S. Nandi, "Evaluation of codes with inherent double replication for Hadoop," in Proc. 6th USENIX Workshop on Hot Topics in Storage and File Systems, pp. 1-5, Philadelphia, USA, Jun. 2014.
11 M. Shahabinejad, M. Khabbazian, and M. Ardakani, "An efficient binary locally repairable code for Hadoop distributed file system," IEEE Commun. Lett., vol. 18, no. 8, pp. 1287-1290, Aug. 2014.   DOI   ScienceOn
12 F. J. MacWilliams and N. J. A. Sloane, The theory of error correcting codes, North-Holland Mathematical Library, 1977.
13 J.-C. Park, "Improving data availability by data partitioning and partial overlapping on multiple cloud storages," J. KICS, vol. 36, no. 12, Nov. 2011.
14 T.-H. Kim, J. Kim, and Y. I. Eom, "A scheme on high-performance caching and high-capacity file transmission for cloud storage optimization," J. KICS, vol. 37C, no. 8, Aug. 2012.
15 J.-H. Kim, J. S. Park, K.-H. Park, M. Y. Nam, and H.-Y. Song, "Trends of regenerating codes for next-generation cloud storage systems," Inf. Commun. Mag., vol. 31, no. 2, pp. 125-131, Feb. 2014.
16 J.-H. Kim and H.-Y. Song, "Coding techniques for distributed storage systems," in Proc. 2013 CITS 3rd CITW, Samsung Electronics, Seoul, Korea, Oct. 2013.
17 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. 39B, no. 11, Nov. 2014.
18 P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, "On the locality of codeword symbols," IEEE Trans. Inform. Theory, vol. 58, no. 11, pp. 6925-6934, Nov. 2012.   DOI   ScienceOn