103 citations · 452 across the 117 of their papers we have counts for
162 papers
Constant-Overhead Injection into Quantum Codes
Louis Golowich, Venkatesan Guruswami
We construct the first known fault-tolerant scheme for injecting states into quantum error-correcting codes with constant space and time overhead. That is, we construct a family of…
The Reach of Abelian Covers in Hypergraphs
Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman
Covers in hypergraphs are frequently studied to capture various forms of dependence between hyperedges. For example, even covers--which check if each vertex appears in an even numb…
Almost Optimal FPT Inapproximability for k-SetCover
Venkatesan Guruswami, Xuandi Ren
We show that -approximate parameterized -SetCover is W[1]-hard, and has no -time algorithms under ETH. This improves upon…
Separating Non-redundancy and Chain Length
Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman
For a constraint satisfaction problem defined by a relation , its non-redundancy is the size of largest instance (as a function of the number of variables)…
Average-Radius List-Decodability of Random Linear Codes
Venkatesan Guruswami, Shilun Li, Mihir Singhal
We prove that for every prime power and every , a random -linear code of rate is -average-radius list-decodable…
Binary code rate bounds via classical--quantum channels
Omar Alrabiah, Venkatesan Guruswami
We derive the four principal asymptotic rate-distance tradeoffs for binary codes---Plotkin, Elias--Bassalygo, and the two McEliece--Rodemich--Rumsey--Welch (MRRW) bounds---from one…