Xing Lin. (1+ε )-optimal MDS codes: contacting any set of helper nodes smaller than n-1. Cryptography and Communications, 18(2):507-524, March 2026. [doi]
@article{Lin26b,
title = {(1+ε )-optimal MDS codes: contacting any set of helper nodes smaller than n-1},
author = {Xing Lin},
year = {2026},
month = {March},
doi = {10.1007/s12095-025-00859-7},
url = {https://doi.org/10.1007/s12095-025-00859-7},
researchr = {https://researchr.org/publication/Lin26b},
cites = {0},
citedby = {0},
journal = {Cryptography and Communications},
volume = {18},
number = {2},
pages = {507-524},
}