Average Repair Read Cost of Linear Repairable Code Ensembles 


Vol. 39,  No. 11, pp. 723-729, Nov.  2014


PDF
  Abstract

In this paper, we derive the average repair bandwidth and/or read cost for arbitrary repairable linear code ensembles. The repair bandwidth and read cost are the required amount of data and access number of nodes to restore a failed node, respectively. Here, the repairable linear code ensemble is given by such parameters as the number k of data symbols, the number m of parity symbols, and their degree distributions. We further assume that the code is systematic, and no other constraint is assumed, except possibly that the exact repair could be done by the parity check-sum relation with fully connected n=k+m storages. This enables one to apply the result of this paper directly to any randomly constructed codes with the above parameters, such as linear fountain codes. The final expression of the average repair read cost shows that it is highly dependent on the degree distribution of parity symbols, and also the values n and k.

  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. S. Park, J. Kim, K. Park, H. Song, "Average Repair Read Cost of Linear Repairable Code Ensembles," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 11, pp. 723-729, 2014. DOI: .

[ACM Style]

Jin Soo Park, Jung-Hyun Kim, Ki-Hyeon Park, and Hong-Yeop Song. 2014. Average Repair Read Cost of Linear Repairable Code Ensembles. The Journal of Korean Institute of Communications and Information Sciences, 39, 11, (2014), 723-729. DOI: .

[KICS Style]

Jin Soo Park, Jung-Hyun Kim, Ki-Hyeon Park, Hong-Yeop Song, "Average Repair Read Cost of Linear Repairable Code Ensembles," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 11, pp. 723-729, 11. 2014.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880