$q$-ary Sequential Locally Recoverable Codes from the Product Construction
Information Theory
2025-07-14 v2 math.IT
Abstract
This work focuses on sequential locally recoverable codes (SLRCs), a special family of locally repairable codes, capable of correcting multiple code symbol erasures, which are commonly used for distributed storage systems. First, we construct an extended -ary family of non-binary SLRCs using code products with a novel maximum number of recoverable erasures and a minimal repair alternativity . Second, we study how MDS and BCH codes can be used to construct -ary SLRCs. Finally, we compare our codes to other LRCs.
Cite
@article{arxiv.2401.07835,
title = {$q$-ary Sequential Locally Recoverable Codes from the Product Construction},
author = {Akram Baghban and Marc Newman and Anna-Lena Horlemann and Mehdi Ghiyasvand},
journal= {arXiv preprint arXiv:2401.07835},
year = {2025}
}