4 citations · 4 across the 5 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2020★ 4 cited
On the list recoverability of randomly punctured codes
Ben Lund, Aditya Potukuchi
We show that a random puncturing of a code with good distance is list recoverable beyond the Johnson bound. In particular, this implies that there are Reed-Solomon codes that are l…
math.CO2019
A spectral bound on hypergraph discrepancy
Aditya Potukuchi
Let be a -regular hypergraph on vertices and edges. Let be the incidence matrix of and let us denote $λ=\max_{v \perp \overl…
math.CO2018
Discrepancy in random hypergraph models
Aditya Potukuchi
We study hypergraph discrepancy in two closely related random models of hypergraphs on vertices and hyperedges. The first model, , is when every vertex is pr…