Manik Dhar

activity

20172026

most citedFlow-GAN: Combining Maximum Likelihood and Adversarial Learning in Generative Models

70 citations · 129 across the 18 of their papers we have counts for

collaborators

Showing 2022Show all

4 papers · 1 filter

cs.IT2022

A construction of Maximally Recoverable LRCs for small number of local groups

Manik Dhar, Sivakanth Gopi

Maximally Recoverable Local Reconstruction Codes (LRCs) are codes designed for distributed storage to provide maximum resilience to failures for a given amount of storage redundanc…

cs.IT2022

Improved Field Size Bounds for Higher Order MDS Codes

Joshua Brakensiek, Manik Dhar, Sivakanth Gopi

Higher order MDS codes are an interesting generalization of MDS codes recently introduced by Brakensiek, Gopi and Makam (IEEE Trans. Inf. Theory 2022). In later works, they were sh…

math.CO2022★ 1 cited

Maximal and $(m, ε)$ -Kakeya bounds over $Z / N Z$ for general $N$

Manik Dhar

We derive Maximal Kakeya estimates for functions over $Z / N Z$ proving the Maximal Kakeya conjecture for $Z / N Z$ for general $N$ as stated by Hickm…

math.CO2022★ 2 cited

Linear Hashing with $ℓ_{\infty}$ guarantees and two-sided Kakeya bounds

Manik Dhar, Zeev Dvir

We show that a randomly chosen linear map over a finite field gives a good hash function in the $ℓ_{\infty}$ sense. More concretely, consider a set $S \subset F_{q}^{n}$ and…

A construction of Maximally Recoverable LRCs for small number of local groups

Improved Field Size Bounds for Higher Order MDS Codes

Maximal and (m,ε)-Kakeya bounds over Z/NZ for general N

Linear Hashing with ℓ∞​ guarantees and two-sided Kakeya bounds

Maximal and $(m, ε)$ -Kakeya bounds over $Z / N Z$ for general $N$

Linear Hashing with $ℓ_{\infty}$ guarantees and two-sided Kakeya bounds