From the 1 of 48 linked papers with an AI index.
1 citations · 1 across the 15 of their papers we have counts for
22 papers · 1 filter
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…
Frequency Coding over Noisy Sampling
Bo-Yu Su, Hsin-Po Wang, Venkatesan Guruswami
DNA molecules are so small that it might be practical to use their frequency vectors to encode messages. More precisely, a sender can inject copies of the string CATCAT…
Locality of Curve-Decoding and Improved Proximity Gaps
Rohan Goyal, Venkatesan Guruswami, Yihang Sun +1
Proximity gaps are a property of error correcting codes that arise in the study of Interactive Oracle Proofs (IOPs) and Succinct Non-interactive Arguments of Zero Knowledge (SNARKs…
Quantum Hierarchical Locally Recoverable Codes
Venkatesan Guruswami, Rutuja Kshirsagar, Pranav Trivedi
Quantum locally recoverable codes (QLRCs) have recently gained attention as a framework for achieving efficient quantum storage with local recovery capabilities. Analogous to their…
Explicit Constant-Alphabet Subspace Design Codes
Rohan Goyal, Venkatesan Guruswami, Jun-Ting Hsieh
The subspace design property for additive codes is a higher-dimensional generalization of the minimum distance property. As shown recently by Brakensiek, Chen, Dhar and Zhang, it i…