Binary Locally Repairable Codes from Complete Multipartite Graphs 


Vol. 40,  No. 9, pp. 1734-1740, Sep.  2015


PDF
  Abstract

This paper introduces a generalized notion, referred to as joint locality, of the usual locality in distributed storage systems and proposes a code construction of binary locally repairable codes with joint locality (r1=2, r2=3 or 4). Joint locality is a set of numbers of nodes for repairing various failure patterns of nodes. The proposed scheme simplifies the code design problem utilizing complete multipartite graphs. Moreover, our construction can generate binary locally repairable codes achieving (2,t)-availability for any positive integer t. It means that each node can be repaired by t disjoint repair sets of cardinality 2. This property is useful for distributed storage systems since it permits parallel access to hot data.

  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]

J. Kim, M. Nam, H. Song, "Binary Locally Repairable Codes from Complete Multipartite Graphs," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 9, pp. 1734-1740, 2015. DOI: .

[ACM Style]

Jung-Hyun Kim, Mi-Young Nam, and Hong-Yeop Song. 2015. Binary Locally Repairable Codes from Complete Multipartite Graphs. The Journal of Korean Institute of Communications and Information Sciences, 40, 9, (2015), 1734-1740. DOI: .

[KICS Style]

Jung-Hyun Kim, Mi-Young Nam, Hong-Yeop Song, "Binary Locally Repairable Codes from Complete Multipartite Graphs," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 9, pp. 1734-1740, 9. 2015.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880