Hey Ryan, many thanks for making those videos! I have one small correction (@ 24mins in). The code that PK give their distance proof for is pretty much exactly the construction that Jens Eberhardt and I proposed in our paper: the balanced product of two Sipser-Spielman codes based on LPS-expander graphs with random local codes. The minor difference is that they use different local codes for each Sipser-Spielman code. Let me emphasise that I think that the distance proof of PK is a great achievement and it is a fantastic that they were able to pull it off!
Hey Ryan, many thanks for making those videos! I have one small correction (@ 24mins in).
The code that PK give their distance proof for is pretty much exactly the construction that Jens Eberhardt and I proposed in our paper: the balanced product of two Sipser-Spielman codes based on LPS-expander graphs with random local codes. The minor difference is that they use different local codes for each Sipser-Spielman code.
Let me emphasise that I think that the distance proof of PK is a great achievement and it is a fantastic that they were able to pull it off!
Thanks! Thanks also for the figures on the title slide!
Such a delightfully clear and thought-provoking exposition!
Kalachev's code jam T-shirt is such a surprise!!!