A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It
From MaRDI portal
Publication:6153665
DOI10.1109/TIT.2022.3225953arXiv2201.00344OpenAlexW4312496252MaRDI QIDQ6153665FDOQ6153665
Authors: Han Cai, Moshe Schwartz 
Publication date: 19 March 2024
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We prove a new lower bound on the field size of locally repairable codes (LRCs). Additionally, we construct maximally recoverable (MR) codes which are cyclic. While a known construction for MR codes has the same parameters, it produces non-cyclic codes. Furthermore, we prove both necessary conditions and sufficient conditions that specify when the known non-cyclic MR codes may be permuted to become cyclic, thus proving our construction produces cyclic MR codes with new parameters. Furthermore, using our new bound on the field size, we show that the new cyclic MR codes have optimal field size in certain cases. Other known LRCs are also shown to have optimal field size in certain cases.
Full work available at URL: https://arxiv.org/abs/2201.00344
Cited In (2)
This page was built for publication: A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153665)
