A projective counting lower bound on linear exact repair costs for MDS array codes is attained for r=2 using Desarguesian spreads.
Amichai Painsky
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative 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.
- NOVA: Fundamental Limits of Knowledge Discovery Through AI