S
Swastik Kopparty
Researcher at Rutgers University
Publications - 127
Citations - 2732
Swastik Kopparty is an academic researcher from Rutgers University. The author has contributed to research in topics: List decoding & Reed–Muller code. The author has an hindex of 26, co-authored 118 publications receiving 2429 citations. Previous affiliations of Swastik Kopparty include Institute for Advanced Study & University of California, Riverside.
Papers
More filters
Journal Article
Split TCP for mobile ad hoc networks
TL;DR: Simulations show that incorporating TCP proxies is beneficial in terms of improving TCP performance in ad hoc networks, and the use of proxies improves the total throughput by as much as 30% in typical scenarios and reduces unfairness significantly.
Proceedings ArticleDOI
Split TCP for mobile ad hoc networks
TL;DR: In this paper, the authors develop a scheme, called split TCP, which separates the TCP functions of congestion control and reliable packet delivery, and they conclude that incorporating TCP proxies is beneficial in terms of improving TCP performance in ad hoc networks.
Journal ArticleDOI
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
TL;DR: The “method of multiplicities” is extended to get results, of interest in combinatorics and randomness extraction, that show that every Kakeya set in $\mathbb{F}_q^n$, the $n$-dimensional vector space over the finite field on $q$ elements, must be of size at least $ q^n/2^n$.
Journal ArticleDOI
List-Decoding Multiplicity Codes
TL;DR: It is shown that univariate multiplicity codes of rate R over fields of prime order can be list-decoded from a (1 R e) fraction of errors in polynomial time (for constant R;e).
Journal ArticleDOI
High-rate codes with sublinear-time decoding
TL;DR: The multiplicity codes as mentioned in this paper are based on evaluating multivariate polynomials and their derivatives, and they inherit the local-decodability of these codes, and at the same time achieve better tradeoffs and flexibility in the rate and minimum distance.