High-Rate Codes with Sublinear Time Decoding - Swastik Kopparty

TCS+ talk: Swastik KoppartyПодробнее

List-Decoding Multiplicity Codes - Swastik KoppartyПодробнее

Swastik Kopparty: Error-correcting Codes - 2Подробнее

Swastik Kopparty: Error-correcting codes - Part 1Подробнее

Error-Correcting Codes - Swastik KoppartyПодробнее

Swastik Kopparty: Error-correcting Codes - Part 3Подробнее

Quasilinear time list decodable codes for space bounded channelsПодробнее

Improved List-Decoding and Local List-Decoding Algorithms for Polynomial Codes - Swastik KoppartyПодробнее

Swastik Kopparty @ Theory LunchПодробнее

STPM - Topics in Randomness and Error-Correcting Codes - Swastik KoppartyПодробнее

Improved Soundness Proving Proximity to Reed-Solomon Codes and STARKsПодробнее

Local Testing and Decoding of Sparse Linear Codes - Shubhangi SarafПодробнее

New Locally Decodable Codes from Lifting - Madhu SudanПодробнее

Exploring SPI: A High-Speed Serial Communication ProtocolПодробнее

Swastik Kopparty (Rutgers): Geometric rank of tensors and the subrank of matrix multiplicationПодробнее

Local Correctability of Expander Codes - Brett HemenwayПодробнее

Proximity gaps for Reed-Solomon CodesПодробнее