Two classes of optimal LRCs with information (r, t)-locality

Pan Tan, Zhengchun Zhou, Vladimir Sidorenko, Udaya Parampalli

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Locally repairable codes (LRCs) with (r, t)-locality have received considerable attention in recent years, since they are able to solve common problems in distributed storage systems such as repairing multiple node failures and managing hot data. Constructing LRCs with excellent parameters becomes an interesting research subject in distributed storage systems and coding theory. In this paper, we present two constructions of LRCs with information (r, t)-locality based on linear algebra and partial geometry, respectively. Both constructions generate LRCs with new parameters which are optimal with respect to the bound proposed by Rawat et al. (IEEE Trans Inf Theory 62(8):4481–4493, 2016).

Original languageEnglish
Pages (from-to)1741-1757
Number of pages17
JournalDesigns, Codes, and Cryptography
Issue number9
Publication statusPublished - 1 Sep 2020
Externally publishedYes


  • Distributed storage systems
  • Locally repairable codes
  • Multiple failures
  • Partial geometry
  • Repair locality


Dive into the research topics of 'Two classes of optimal LRCs with information (r, t)-locality'. Together they form a unique fingerprint.

Cite this