Xing Lin. $$(1+\epsilon )$$-optimal MDS codes: contacting any set of helper nodes smaller than $$n-1$$. // Cryptography and Communications. – 2026. – DOI: 10.1007/s12095-025-00859-7. – URL: https://doi.org/10.1007/s12095-025-00859-7
Xing Lin (2026). $$(1+\epsilon )$$-optimal MDS codes: contacting any set of helper nodes smaller than $$n-1$$. Cryptography and Communications. https://doi.org/10.1007/s12095-025-00859-7
Xing Lin. “$$(1+\epsilon )$$-optimal MDS codes: contacting any set of helper nodes smaller than $$n-1$$.” Cryptography and Communications, 2026. doi:10.1007/s12095-025-00859-7.
@article{Lin2026,
title = {\$\$(1+\epsilon )\$\$-optimal MDS codes: contacting any set of helper nodes smaller than \$\$n-1\$\$},
author = {Lin, Xing},
journal = {Cryptography and Communications},
year = {2026},
doi = {10.1007/s12095-025-00859-7},
url = {https://doi.org/10.1007/s12095-025-00859-7}
}