Jul 2026
New perspectives for code locality in the rank metric
This work relies on a precise study of code puncturing and shortening for codes viewed as spaces of linear maps and derives a Singleton-like bound for rank locally recoverable codes, and proves that a construction similar to classical Tamo-Barg codes is optimal with respect to this bound.
Camille Garnier, Julien Lavauzelle, Jade Nardi et al.
· arXiv.org · 0 citations