Cyclic and convolutional codes with locality
Abstract
Locally recoverable (LRC) codes and their variants have been extensively studied in recent years. In this paper we focus on cyclic constructions of LRC codes and derive conditions on the zeros of the code that support the property of hierarchical locality. As a result, we obtain a general family of hierarchical LRC codes for a new range of code parameters. We also observe that our approach enables one to represent an LRC code in quasicyclic form, and use this representation to construct tail-biting convolutional LRC codes with locality. Among other results, we extend the general approach to cyclic codes with locality to multidimensional cyclic codes, yielding new families of LRC codes with availability, and construct a family of q-ary cyclic hierarchical LRC codes of unbounded length.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2020
- DOI:
- 10.48550/arXiv.2004.06770
- arXiv:
- arXiv:2004.06770
- Bibcode:
- 2020arXiv200406770C
- Keywords:
-
- Computer Science - Information Theory
- E-Print:
- An extended abstract of this work appears in Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT 2020)