Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
by Itzhak Tamo; Alexander Barg; Sreechakra Goparaju; Robert Calderbank
International Journal of Information and Coding Theory (IJICOT), Vol. 3, No. 4, 2016

Abstract: We consider linear cyclic codes with the locality property or locally recoverable codes (LRC codes). A family of LRC codes that generalises the classical construction of Reed-Solomon codes was constructed in a recent paper by Tamo and Barg (IEEE Transactions on Information Theory, No. 8, 2014). In this paper, we focus on distance-optimal cyclic codes that arise from this construction. We give a characterisation 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. The locality parameter of a cyclic code is related to the dual distance of this code, and we phrase our results in terms of upper bounds on the dual distance.

Online publication date: Thu, 29-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Coding Theory (IJICOT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email