Reverse implication between the two paradigms for near-Singleton erasure coding
Determine whether codes that approach the Singleton bound over constant-sized alphabets (the second paradigm) can be systematically transformed to small-sized erasure code families over fixed alphabets that achieve near-optimal adversarial erasure correction; establish such a reverse implication at least for suitably structured constructions.
References
A natural question would be to study whether the reverse could also be true at least for specifically structured constructions.
— Optimal Erasure Codes and Codes on Graphs
(Chen et al., 3 Apr 2025) in Concluding Remarks