Locally Repairable Codes with Two Different Locality Requirements 


Vol. 41,  No. 12, pp. 1671-1683, Dec.  2016


PDF
  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, δ) -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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

G. Kim and J. Lee, "Locally Repairable Codes with Two Different Locality Requirements," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 12, pp. 1671-1683, 2016. DOI: .

[ACM Style]

Geonu Kim and Jungwoo Lee. 2016. Locally Repairable Codes with Two Different Locality Requirements. The Journal of Korean Institute of Communications and Information Sciences, 41, 12, (2016), 1671-1683. DOI: .

[KICS Style]

Geonu Kim and Jungwoo Lee, "Locally Repairable Codes with Two Different Locality Requirements," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 12, pp. 1671-1683, 12. 2016.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880