The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

Distributed Storage Codes with Multiple Replication Degrees Using Relative Difference Families

상대 차족을 이용한 복수 반복 차수 분산 저장 부호

  • Park, Hosung (School of Electronics and Computer Engineering, Chonnam National University) ;
  • Kim, Cheol-Sung (School of Electronics and Computer Engineering, Chonnam National University)
  • Received : 2016.10.16
  • Accepted : 2016.11.14
  • Published : 2016.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose a construction method of fractional repetition codes, a class of distributed storage codes, using relative difference families. The proposed codes can support multiple replication degrees for data symbols. It is shown via simulation that the proposed codes store more data than the random fractional repetition codes.

본 논문에서 상대 차족을 이용하여 분산 저장 부호의 한 종류인 분할 반복 부호를 설계하는 방법을 제안한다. 제안하는 부호는 각 데이터 심볼마다 다른 반복 차수를 지원할 수 있다. 모의실험을 통하여 제안하는 부호가 랜덤 분할 반복 부호보다 더 많은 양의 데이터를 저장할 수 있음을 보인다.

Keywords

References

  1. D. S. Papailiopoulos and A. G. Dimakis, "Locally repairable codes," IEEE Trans. Inf. Theory, vol. 60, no. 10, pp. 5843-5855, Oct. 2014. https://doi.org/10.1109/TIT.2014.2325570
  2. 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.
  3. S. E. Rouayheb and K. Ramchandran, "FR codes for repair in distributed storage systems," in Proc. 48th Annu. Allerton Conf. Contr., Comput., Commun., pp. 1510-1517, Urbana-Champaign, IL, USA, Sept. 2010,
  4. M. Buratti, Y. Wei, D. Wu, P. Fan, and M. Cheng, "Relative difference families with variable block sizes and their related OOCs," IEEE Trans. Inf. Theory, vol. 57, no. 11, pp. 7489-7497, Nov. 2011. https://doi.org/10.1109/TIT.2011.2162225
  5. S. Pawar, N. Noorshams, S. E. Rouayheb, and K. Ramchandran, "DRESS codes for the storage cloud: Simple randomized constructions," in Proc. IEEE Symp. Inf. Theory, pp. 2338-2342, St. Petersburg, Russia, Aug. 2011.