activity
20042021
most citedElliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields

2 citations · 2 across the 1 of their papers we have counts for

collaborators
Showing cs.ITShow all

1 paper · 1 filter

cs.IT2004

Robust Locally Testable Codes and Products of Codes

Eli Ben-Sasson, Madhu Sudan

We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining i…