JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Construction of [2k-1+k, k, 2k-1+1] Codes Attaining Griesmer Bound and Its Locality
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Construction of [2k-1+k, k, 2k-1+1] Codes Attaining Griesmer Bound and Its Locality
Kim, Jung-Hyun; Nam, Mi-Young; Park, Ki-Hyeon; Song, Hong-Yeop;
  PDF(new window)
 Abstract
In this paper, we introduce two classes of optimal codes, [, k, ] simplex codes and [, k, ] codes, attaining Griesmer bound with equality. We further present and compare the locality of them. The [, k, ] codes have good locality property as well as optimal code length with given code dimension and minimum distance. Therefore, we expect that [, k, ] codes can be applied to various distributed storage systems.
 Keywords
Distributed Storage Systems;Locality;Locally Repairable Codes;Griesmer Bound;Optimal Codes;
 Language
Korean
 Cited by
1.
완전다분할그래프 기반 이진 부분접속복구 부호,김정현;남미영;송홍엽;

한국통신학회논문지, 2015. vol.40. 9, pp.1734-1740 crossref(new window)
2.
부분접속 복구 가능한 반복분할 부호,남미영;김정현;송홍엽;

한국통신학회논문지, 2015. vol.40. 9, pp.1741-1753 crossref(new window)
3.
분산 저장 시스템을 위한 부분접속 복구부호,남미영;김정현;송홍엽;

정보와 통신, 2015. vol.32. 6, pp.3-8
4.
두 개의 다른 부분접속수 요건을 가진 부분접속 복구 부호,김건우;이정우;

한국통신학회논문지, 2016. vol.41. 12, pp.1671-1683 crossref(new window)
 References
1.
J.-C. Park, "Improving data availability by data partitioning and partial overlapping on multiple cloud storages," J. KICS, vol. 36, no. 12, Nov. 2011.

2.
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.

3.
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.

4.
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.

5.
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.

6.
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. crossref(new window)

7.
D. S. Papailiopoulos and A. G. Dimakis, "Locally repairable codes," IEEE Trans. Inf. Theory, vol. 60, no. 10, pp. 5843-5855, Oct. 2014. crossref(new window)

8.
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.

9.
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.

10.
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.

11.
M. Kuijper and D. Napp, Erasure codes with simplex locality(2014), Last access(Feb. 16, 2015), http://arxiv.org/abs/1403.2779.

12.
J. H. Griesmer, "A bound for error-correcting codes," IBM J. Res. Develop., vol. 4, pp. 532-542, Nov. 1960. crossref(new window)

13.
W. C. Huffman and V. Pless, Fundamentals of error correcting codes, Cambridge, 2003.

14.
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.

15.
T. Helleseth, "New constructions of codes meeting the Griesmer bound," IEEE Trans. Inf. Theory, vol. 29, no. 3, pp. 434-439, Mar. 1983. crossref(new window)

16.
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.

17.
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. crossref(new window)

18.
F. J. MacWilliams and N. J. A. Sloane, The theory of error correcting codes, North-Holland Mathematical Library, 1977.