Omar Alrabiah

Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields

2024

Reed–Solomon codes are a classic family of error-correcting codes consisting of evaluations of low-degree polynomials over a finite field on some sequence of distinct field elements. They are widely known for their optimal unique-decoding capabilities, …

Ideal Pseudorandom Codes

2024 · arXiv (Cornell University)

Pseudorandom codes are error-correcting codes with the property that no efficient adversary can distinguish encodings from uniformly random strings. They were recently introduced by Christ and Gunn [CRYPTO 2024] for the purpose of watermarking the …