Excited to share a joint work with Joshua Brakensiek, Yeyuan Chen, Louie Putterman, and Zihan Zhang (@VVfishtail) on list decoding Reed–Solomon codes up to capacity in the low, but still constant, rate regime!
https://t.co/zlpOruHVy9
1/5
Thanks to Omar Alrabiah (@omaralrabiah99), Venkat Guruswami (@venkatguruswami), and Rohan Goyal for a neat one-liner boosting our low-rate result to all rates.
To list decode at higher rates, pad with 0s until the rate is small enough, then do low-rate LD + pruning.
Excited to share a joint work with Joshua Brakensiek, Yeyuan Chen, Louie Putterman, and Zihan Zhang (@VVfishtail) on list decoding Reed–Solomon codes up to capacity in the low, but still constant, rate regime!
https://t.co/zlpOruHVy9
1/5
For anyone interested in following along: an AI-generated version of the proximity-gaps/MCA paper and a Lean proof of the list-decoding result are here:
https://t.co/7mZjQFxK9E
We’re also working on a Lean proof of the proximity-gaps result.
5/5
Using similar techniques, we can also obtain analogous mutual correlated agreement (MCA) results up to capacity, again in the low but constant rate regime.
We’re working on cleaning this up and hope to post it soon!
4/5