Cyclic LRC codes and their subfield subcodes

@article{Tamo2015CyclicLC,
  title={Cyclic LRC codes and their subfield subcodes},
  author={Itzhak Tamo and Alexander Barg and Sreechakra Goparaju and A. Robert Calderbank},
  journal={2015 IEEE International Symposium on Information Theory (ISIT)},
  year={2015},
  pages={1262-1266}
}
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A. Barg (IEEE Trans. IT, no. 8, 2014). In this paper we focus on the optimal cyclic codes that arise from the general construction. We give a characterization of these codes in terms of their zeros, and observe that there are many equivalent ways of… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Citations

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

Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes

IEEE Trans. Information Theory • 2018
View 13 Excerpts
Highly Influenced

Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes

IEEE Transactions on Information Theory • 2018
View 13 Excerpts
Highly Influenced

On Optimal Pseudo-cyclic ($r, \delta$) Locally Repairable Codes

2018 IEEE International Symposium on Information Theory (ISIT) • 2018
View 7 Excerpts
Highly Influenced

Balanced and sparse Tamo-Barg codes

2017 IEEE International Symposium on Information Theory (ISIT) • 2017
View 4 Excerpts
Highly Influenced

Locality of optimal binary codes

Finite Fields and Their Applications • 2017
View 8 Excerpts
Highly Influenced

On the Maximal Code Length of Optimal Linear Locally Repairable Codes

2018 IEEE International Symposium on Information Theory (ISIT) • 2018
View 1 Excerpt

55 Citations

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

See our FAQ for additional information.

References

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

On the Locality of Codeword Symbols

IEEE Transactions on Information Theory • 2011
View 4 Excerpts
Highly Influenced

Binary cyclic codes that are locally repairable

2014 IEEE International Symposium on Information Theory • 2014
View 1 Excerpt

An upper bound on the size of locally recoverable codes

2013 International Symposium on Network Coding (NetCod) • 2013

Hamming Weights in Irreducible Cyclic Codes

Discrete Mathematics • 2013
View 2 Excerpts

Locally Repairable Codes

IEEE Transactions on Information Theory • 2012
View 1 Excerpt

Optimal linear codes with a local-error-correction property

2012 IEEE International Symposium on Information Theory Proceedings • 2012
View 3 Excerpts

Similar Papers

Loading similar papers…