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
173 2018 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
126 2018 Method and system for load balancing in a software-defined networking (SDN) system upon server reconfiguration R Basavaraja, P Anand, M Arisoylu, H Asnani, M Vajha, A Mukundan
US Patent 9,497,123, 2016
107 2016 An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and all-node repair B Sasidharan, M Vajha, PV Kumar
arXiv preprint arXiv:1607.07335, 2016
94 2016 Binary, shortened projective reed muller codes for coded private information retrieval M Vajha, V Ramkumar, PV Kumar
Information Theory (ISIT), 2017 IEEE International Symposium on, 2648-2652, 2017
37 2017 Codes for distributed storage V Ramkumar, M Vajha, SB Balaji, MN Krishnan, B Sasidharan, PV Kumar
Concise Encyclopedia of Coding Theory, 735-762, 2021
36 2021 Simple Streaming Codes for Reliable, Low-Latency Communication MN Krishnan, V Ramkumar, M Vajha, PV Kumar
IEEE Communications Letters, 2019
27 2019 Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound SB Balaji, M Vajha, PV Kumar
IEEE Transactions on Information Theory 68 (10), 6452-6471, 2022
24 * 2022 Small-d MSR codes with optimal access, optimal sub-packetization and linear field size M Vajha, SB Balaji, PV Kumar
IEEE Transactions on Information Theory, 2023
17 * 2023 Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes B Sasidharan, N Prakash, MN Krishnan, M Vajha, K Senthoor, PV Kumar
International Journal of Information and Coding Theory 3 (4), 255-298, 2016
16 2016 Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for M Vajha, BS Babu, PV Kumar
2018 IEEE International Symposium on Information Theory (ISIT), 2376-2380, 2018
15 2018 Explicit rate-optimal streaming codes with smaller field size M Vajha, V Ramkumar, MN Krishnan, PV Kumar
IEEE Transactions on Information Theory, 2023
12 2023 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
12 2020 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
7 * 2021 Locally Recoverable Streaming Codes for Packet-Erasure Recovery V Ramkumar, M Vajha, PV Kumar
2021 IEEE Information Theory Workshop (ITW), 1-6, 2021
6 2021 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
5 2018 Generalized Simple Streaming Codes from MDS Codes V Ramkumar, M Vajha, PV Kumar
2021 IEEE International Symposium on Information Theory (ISIT), 878-883, 2021
4 2021 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
3 2022 Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes M Vajha, VSC Mukka, PV Kumar
2019 IEEE International Symposium on Information Theory (ISIT), 31-35, 2019
2 2019 Streaming Codes for Three-Node Relay Networks With Burst Erasures V Ramkumar, M Vajha, MN Krishnan
2024 
P Vijay KumarHon. Professor, Indian Institute of ScienceDirección de correo verificada de iisc.ac.in
