10 citations · 18 across the 6 of their papers we have counts for
6 papers
New Constructions of SD and MR Codes over Small Finite Fields
Guangda Hu, Sergey Yekhanin
Data storage applications require erasure-correcting codes with prescribed sets of dependencies between data symbols and redundant symbols. The most common arrangement is to have $…
Maximally Recoverable Codes for Grid-like Topologies
Parikshit Gopalan, Guangda Hu, Swastik Kopparty +3
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in…
Sylvester-Gallai for Arrangements of Subspaces
Zeev Dvir, Guangda Hu
In this work we study arrangements of -dimensional subspaces . Our main result shows that, if every pair of subspaces is cont…
Lower Bounds for Approximate LDC
Jop Briët, Zeev Dvir, Guangda Hu +1
We study an approximate version of -query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A -query -a…
Matching-Vector Families and LDCs Over Large Modulo
Zeev Dvir, Guangda Hu
We prove new upper bounds on the size of families of vectors in with restricted modular inner products, when is a large integer. More formally, if $\vec{u}_1,\ldots,\v…
On the Hyperbolicity of Small-World and Tree-Like Random Graphs
Wei Chen, Wenjie Fang, Guangda Hu +1
Hyperbolicity is a property of a graph that may be viewed as being a "soft" version of a tree, and recent empirical and theoretical work has suggested that many graphs arising in I…