Optimal linear and cyclic locally repairable codes over small fields

@article{Zeh2015OptimalLA,
  title={Optimal linear and cyclic locally repairable codes over small fields},
  author={Alexander Zeh and Eitan Yaakobi},
  journal={2015 IEEE Information Theory Workshop (ITW)},
  year={2015},
  pages={1-5}
}
We consider locally repairable codes over small fields and propose constructions of optimal cyclic and linear codes in terms of the dimension for a given distance and length. Four new constructions of optimal linear codes over small fields with locality properties are developed. The first two approaches give binary cyclic codes with locality two. While the first construction has availability one, the second binary code is characterized by multiple available repair sets based on a binary Simplex… CONTINUE READING
Highly Cited
This paper has 60 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Citations

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

61 Citations

01020302015201620172018
Citations per Year
Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

References

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

Similar Papers

Loading similar papers…