The Minimum Subpacketization of Reed-Solomon Codes with Linear Repair Achieving the Cut-Set Bound

2026-10-28来源 arXiv math.ITEnglish
arXiv:2610.37522v1 Announce Type: new Abstract: In this paper, we study the minimum subpacketization of $(n,k)$ Reed-Solomon (RS) codes over $\mathbb{F}_{q^\ell}$ admitting cut-set-optimal exact $\mathbb{F}_q$-linear repair of every coordinate from any $d$ helpers. For $3\le k

原文：https://www.a8q9.cn/en/article/the-minimum-subpacketization-of-reed-solomon-codes-with-linear-repair-achieving--df593d.html

相关文章