PaperMetrixEvidence-aware discovery
TR
Interface language English EN العربية AR Türkçe TR
Create account
Researcher profile

Swastik Kopparty

2 papers in the PaperMetrix corpus

Publications

Papers by this author

  1. On Proximity Gaps of Reed-Solomon Codes

    2020

    A collection of sets displays a proximity gap with respect to some property if for every set in the collection, either (i) all members are δ-close to the property in relative Hamming distance or (ii) …

  2. Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields

    2021 · arXiv (Cornell University)

    For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division, interpolation and …