Follow
Vinayak Ramkumar
Vinayak Ramkumar
Postdoctoral Fellow, Tel Aviv University
Verified email at tauex.tau.ac.il
Title
Cited by
Cited by
Year
Erasure coding for distributed storage: An overview
SB Balaji, MN Krishnan, M Vajha, V Ramkumar, B Sasidharan, PV Kumar
Science China Information Sciences 61, 1-45, 2018
1312018
Clay codes: Moulding {MDS} codes to yield an {MSR} code
M Vajha, V Ramkumar, B Puranik, G Kini, E Lobo, B Sasidharan, ...
16th USENIX Conference on File and Storage Technologies (FAST 18), 139-154, 2018
1022018
Binary, shortened projective Reed Muller codes for coded private information retrieval
M Vajha, V Ramkumar, PV Kumar
2017 IEEE International Symposium on Information Theory (ISIT), 2648-2652, 2017
352017
Simple streaming codes for reliable, low-latency communication
MN Krishnan, V Ramkumar, M Vajha, PV Kumar
IEEE Communications Letters 24 (2), 249-253, 2019
232019
Coded MapReduce schemes based on placement delivery array
V Ramkumar, PV Kumar
2019 IEEE International Symposium on Information Theory (ISIT), 3087-3091, 2019
172019
Codes for distributed storage
V Ramkumar, M Vajha, SB Balaji, MN Krishnan, B Sasidharan, PV Kumar
Concise Encyclopedia of Coding Theory, 735-762, 2021
152021
Staggered diagonal embedding based linear field size streaming codes
V Ramkumar, M Vajha, MN Krishnan, PV Kumar
2020 IEEE International Symposium on Information Theory (ISIT), 503-508, 2020
122020
Explicit rate-optimal streaming codes with smaller field size
M Vajha, V Ramkumar, MN Krishnan, PV Kumar
IEEE Transactions on Information Theory, 2023
82023
On the performance analysis of streaming codes over the gilbert-elliott channel
M Vajha, V Ramkumar, M Jhamtani, PV Kumar
2021 IEEE Information Theory Workshop (ITW), 1-6, 2021
62021
On sliding window approximation of gilbert-elliott channel for delay constrained setting
M Vajha, V Ramkumar, M Jhamtani, PV Kumar
CoRR, 2020
52020
Locally recoverable streaming codes for packet-erasure recovery
V Ramkumar, M Vajha, PV Kumar
2021 IEEE Information Theory Workshop (ITW), 1-6, 2021
42021
Generalized simple streaming codes from mds codes
V Ramkumar, M Vajha, PV Kumar
2021 IEEE International Symposium on Information Theory (ISIT), 878-883, 2021
42021
Rate-Optimal Streaming Codes with Smaller Field Size Under Less-Stringent Decoding-Delay Requirements
S Bhatnagar, V Ramkumar, PV Kumar
2022 IEEE Information Theory Workshop (ITW), 612-617, 2022
32022
On Information-Debt-Optimal Streaming Codes With Small Memory
V Ramkumar, MN Krishnan, M Vajha, PV Kumar
2022 IEEE International Symposium on Information Theory (ISIT), 1578-1583, 2022
32022
Determining the generalized hamming weight hierarchy of the binary projective Reed-Muller code
V Ramkumar, M Vajha, PV Kumar
2018 Twenty Fourth National Conference on Communications (NCC), 1-5, 2018
32018
Coefficient Complexity in Low-Access Quantized Linear Computations
V Ramkumar, N Raviv, I Tamo
2023 59th Annual Allerton Conference on Communication, Control, and …, 2023
12023
Access-Redundancy Tradeoffs in Quantized Linear Computations
V Ramkumar, N Raviv, I Tamo
arXiv preprint arXiv:2305.06101, 2023
12023
Private Inference in Quantized Models
Z Deng, V Ramkumar, R Bitar, N Raviv
arXiv preprint arXiv:2311.13686, 2023
2023
Near-Optimal Streaming Codes with Linear Field Size
V Ramkumar, S Bhatnagar, PV Kumar
2023 IEEE International Symposium on Information Theory (ISIT), 1118-1123, 2023
2023
Explicit Information-Debt-Optimal Streaming Codes With Small Memory
MN Krishnan, M Vajha, V Ramkumar, PV Kumar
arXiv preprint arXiv:2305.06303, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20