2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | M.3.4 | ||
| Paper Title | Cyclic LRC codes with hierarchy and availability | ||
| Authors | Zitan Chen, Alexander Barg, University of Maryland, United States | ||
| Session | M.3: Codes for Distributed Storage III | ||
| Presentation | Lecture | ||
| Track | Coding for Storage and Memories | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | Locally recoverable (LRC) codes and their variants have been extensively studied in recent years. In this paper we focus on cyclic LRC codes, presenting two results regarding codes with hierarchical locality and codes with availability. Regarding hierarchical LRC codes, we observe that the cyclic codes of Tamo et al. (2016) can be generalized to yield optimal families with multiple levels of locality for a broader range of parameters than known previously. We also observe that the general approach to cyclic codes with locality can be extended to multidimensional cyclic codes, yielding new families of LRC codes with availability. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
