Codes with local regeneration

@article{Kamath2013CodesWL,
  title={Codes with local regeneration},
  author={Govinda M. Kamath and Neeraj Prakash and V. Lalitha and P. Vijay Kumar},
  journal={2013 IEEE International Symposium on Information Theory},
  year={2013},
  pages={1606-1610}
}
Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance… CONTINUE READING
Highly Cited
This paper has 107 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
64 Citations
35 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 64 extracted citations

108 Citations

02040'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 108 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Hdfs Raid

  • D. Borthakur, R. Schmit, R. Vadali, S. Chen, P. Kling
  • Tech talk. Yahoo Developer Network, 2010.
  • 2010
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…