8 citations · 13 across the 14 of their papers we have counts for
1 paper · 1 filter
Ben Lund, Aditya Potukuchi
We show that a random puncturing of a code with good distance is list recoverable beyond the Johnson bound. In particular, this implies that there are Reed-Solomon codes that are l…