4 citations · 4 across the 5 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2019
Improved efficiency for covering codes matching the sphere-covering bound
Aditya Potukuchi, Yihan Zhang
A covering code is a subset with the property that any is close to some in Hamming distance. For every $ε,δ>…
cs.IT2017
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
Swastik Kopparty, Aditya Potukuchi
Reed-Muller codes are some of the oldest and most widely studied error-correcting codes, of interest for both their algebraic structure as well as their many algorithmic properties…