Erasure codes with simplex locality

  title={Erasure codes with simplex locality},
  author={Margreta Kuijper and Diego Napp Avelli},
We focus on erasure codes for distributed storage. The distributed storage setting imposes locality requirements because of easy repair demands on the decoder. We first establish the characterization of various locality properties in terms of the generator matrix of the code. These lead to bound s on locality and notions of optimality. We then examine the locality properties of a family of nonbinary codes with simplex structure. We investigate their optimality and design seve ral easy repair… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.
11 Citations
17 References
Similar Papers


Publications citing this paper.


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


  • L. Pamies-Juarez, H.D.L. Hollmann
  • Oggier, ”Locall y Repairable Codes with Multiple…
  • 2013
1 Excerpt

Quasi-cyclic regene rating codes

  • B. Gaston, P. Pujol, M. Villanueva
  • IEEE Transactions on Information Theory (under…
  • 2013
1 Excerpt

Codes wi th local regeneration

  • G. Kamath, N. Prakash, V. Lalitha, P. Kumar
  • arXiv preprint arXiv:1211.1932
  • 2012
1 Excerpt

Storage codes wit h optimal repair locality

  • D. S. Papailiopoulos, A. G. Dimakis
  • Proceedings of the IEEE Intl. Symposium on…
  • 2012
1 Excerpt

Similar Papers

Loading similar papers…