Some New Sequential-Recovery LRCs Based on Good Polynomials

Zhi Jing, Hong Yeop Song

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


We propose a new construction of sequential-recovery Locally Repairable Codes (LRCs) of length n with even locality r for two erasures, based on some 'good' polynomials, over a relatively small alphabet of size q \approx \frac {(r+1)n}{r+2} , which becomes rate optimal in some cases. We also derive an explicit form of the upper bound on the minimum distance of these codes with some additional constraints. The minimum distance of the proposed sequential-recovery LRCs for r=2 achieves this explicit bound when k = \frac {n}{2} and is one less than the bound when k < \frac {n}{2}.

Original languageEnglish
Pages (from-to)42844-42850
Number of pages7
JournalIEEE Access
Publication statusPublished - 2022

Bibliographical note

Publisher Copyright:
© 2013 IEEE.

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)


Dive into the research topics of 'Some New Sequential-Recovery LRCs Based on Good Polynomials'. Together they form a unique fingerprint.

Cite this