Preprint
Aug 2026
Time- and Space-Efficient List Decoding up to Capacity
A family of codes with rate R that are deterministically list-decodable up to radius $\rho = 1 - R - \tau$ in time $N^{1 + \tau}$ and space $N^{\tau}$ with constant output list size and constant alphabet size is presented.
Dorsa Fathollahi, Noga Ron-Zewi, Mary K. Wootters
· 0 citations