A projective counting lower bound on linear exact repair costs for MDS array codes is attained for r=2 using Desarguesian spreads.
org/conference/fast25/presentation/gan
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
A projective counting lower bound on linear exact repair costs for MDS array codes is attained for r=2 using Desarguesian spreads.