Cyclic LRC codes and their subfield subcodes

Published

Conference Paper

© 2015 IEEE. 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 constructing optimal cyclic LRC codes over a given field. We also study subfield subcodes of cyclic LRC codes (BCH-like LRC codes) and establish several results about their locality and minimum distance.

Full Text

Duke Authors

Cited Authors

  • Tamo, I; Barg, A; Goparaju, S; Calderbank, R

Published Date

  • September 28, 2015

Published In

Volume / Issue

  • 2015-June /

Start / End Page

  • 1262 - 1266

International Standard Serial Number (ISSN)

  • 2157-8095

International Standard Book Number 13 (ISBN-13)

  • 9781467377041

Digital Object Identifier (DOI)

  • 10.1109/ISIT.2015.7282658

Citation Source

  • Scopus