A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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.

Original languageEnglish
Pages (from-to)2240-2260
Number of pages20
JournalIEEE Transactions on Information Theory
Issue number4
StatePublished - 1 Apr 2023


  • Distributed storage
  • cyclic codes
  • locally repairable codes
  • maximally recoverable codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this