Let's Have Both! Optimal List-Recoverability With Polynomial Randomness via Alphabet Permutation Codes

Sergey A. Komech, Jonathan Mosheiff. Let's Have Both! Optimal List-Recoverability With Polynomial Randomness via Alphabet Permutation Codes. IEEE Transactions on Information Theory, 72(3):1683-1690, March 2026. [doi]

Abstract

Abstract is missing.