• Postdoctoral Researcher  

Institute for Communications Engineering,

TUM School of Computation, Information and Technology

Technical University of Munich

Supervisor: Prof. Antonia Wachter-Zeh

• Postdoctoral Fellow (Jan 2023 - Dec 2024)

Department of Electrical Engineering-Systems,

Tel Aviv University, Israel

Supervisor: Prof. Itzhak Tamo

• Visiting Researcher (Aug 2023 - Dec 2023)

Department of Computer Science & Engineering,

Washington University in St. Louis, MO, USA

Supervisor: Prof. Netanel Raviv

• Ph.D. (2023)

Department of Electrical Communication Engineering,

Indian Institute of Science, Bangalore, India

Supervisor: Prof. P. Vijay Kumar

Thesis: Efficient Constructions of Streaming Codes

• M.Sc. Engg. (2017)

Department of Electrical Communication Engineering,

Indian Institute of Science, Bangalore, India

Supervisor: Prof. P. Vijay Kumar

Thesis: On Codes for Private Information Retrieval and Ceph Implementation of a High-Rate Regenerating Code

• B.Tech. (2015)

Electronics and Communication Engineering,

National Institute of Technology, Calicut, India

Coding and information theory with a focus on: 

• • Coded computation

  • Codes for distributed storage

  • Information-theoretic privacy

  • Codes for low-latency streaming

  • Quantum codes

  • Codes for edit errors

See my Google Scholar page.  

Monograph 

• Codes for Distributed Storage

Vinayak Ramkumar, S. B. Balaji, Birenjith Sasidharan, Myna Vajha, M. Nikhil Krishnan, and P. Vijay Kumar

Foundations and Trends in Communications and Information Theory: Vol. 19: No. 4, 2022, pp 547-813.

Book chapter 

• Codes for Distributed Storage

Vinayak Ramkumar, Myna Vajha, S. B. Balaji, M. Nikhil Krishnan, Birenjith Sasidharan, and P. Vijay Kumar

Chapter in Concise Encyclopedia of Coding Theory, 

Edited by C.W. Huffman, J.-L. Kim, P. Sole, CRC Press, 2021.

Invited survey

• Erasure Coding for Distributed Storage: An Overview

Balaji S. B., M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, Birenjith Sasidharan, and P. Vijay Kumar

Science China Information Sciences, 61(10): 100301:1-100301:45 (2018).

Journals

• Epsilon-MSR Codes for Any Set of Helper Nodes

Vinayak Ramkumar, Netanel Raviv, and Itzhak Tamo

IEEE Transactions on Information Theory, Early Access. 

• Quantum Locally Recoverable Codes via Good Polynomials

Sandeep Sharma, Vinayak Ramkumar, and Itzhak Tamo

IEEE Journal on Selected Areas in Information Theory, 6: 100-110 (2025).  

• Private Inference in Quantized Models

Zirui (Ken) Deng, Vinayak Ramkumar, Rawad Bitar, and Netanel Raviv

IEEE Transactions on Information Theory, 71(5): 3957-3973 (2025).

• Streaming Codes for Three-Node Relay Networks With Burst Erasures

Vinayak Ramkumar, Myna Vajha, and M. Nikhil Krishnan

IEEE Transactions on Information Theory, 71(1): 348-359 (2025).

• Access-Redundancy Tradeoffs in Quantized Linear Computations

Vinayak Ramkumar, Netanel Raviv, and Itzhak Tamo

IEEE Transactions on Information Theory, 70(11): 7723-7739 (2024).

• Explicit Rate-Optimal Streaming Codes with Smaller Field Size

Myna Vajha, Vinayak Ramkumar, M. Nikhil Krishnan, and P. Vijay Kumar

IEEE Transactions on Information Theory 70(5): 3242-3261 (2024).

• Simple Streaming Codes for Reliable, Low-Latency Communication

M. Nikhil Krishnan, Vinayak Ramkumar, Myna Vajha, and P. Vijay Kumar

IEEE Communications Letters 24(2): 249-253 (2020).

Conference Proceedings

• Streaming Codes for Multi-Hop Relay Networks With Burst Erasures

Vinayak Ramkumar, M. Nikhil Krishnan, and Myna Vajha

Accepted to IEEE International Symposium on Information Theory (ISIT) 2025.

• On Linear Field Size Access-Optimal MDS Convertible Codes

M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, G. Yeswanth Sai, and Xiangliang Kong

Accepted to IEEE International Symposium on Information Theory (ISIT), 2025.

• Individual Confidential Computing of Polynomials over Non-Uniform Information

Saar Tarnopolsky, Zirui (Ken) Deng, Vinayak Ramkumar, Netanel Raviv, and Alejandro Cohen

Accepted to IEEE International Symposium on Information Theory (ISIT), 2025.

• Non-Binary Covering Codes for Low-Access Computations

Vinayak Ramkumar, Netanel Raviv, and Itzhak Tamo

IEEE International Symposium on Information Theory (ISIT), 2024.

• Streaming Codes for Three-Node Relay Networks With Burst Erasures

Vinayak Ramkumar, Myna Vajha, and M. Nikhil Krishnan 

IEEE International Symposium on Information Theory (ISIT), 2024.

• Perfect Subset Privacy in Polynomial Computation

Zirui (Ken) Deng, Vinayak Ramkumar, and Netanel Raviv 

IEEE International Symposium on Information Theory (ISIT), 2024.

• On Multi-Path Streaming Codes

Vinayak Ramkumar, Shobhit Bhatnagar, and P. Vijay Kumar

National Conference on Communications (NCC), 2024.

• Coefficient Complexity in Low-Access Quantized Linear Computations

Vinayak Ramkumar, Netanel Raviv, and Itzhak Tamo

59th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2023.

• Access-Redundancy Tradeoffs in Quantized Linear Computations

Vinayak Ramkumar, Netanel Raviv, and Itzhak Tamo

IEEE International Symposium on Information Theory (ISIT), 2023.

• Explicit Information-Debt-Optimal Streaming Codes With Small Memory

M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, and P. Vijay Kumar

IEEE International Symposium on Information Theory (ISIT), 2023.

• Near-Optimal Streaming Codes with Linear Field Size

Vinayak Ramkumar, Shobhit Bhatnagar, and P. Vijay Kumar 

IEEE International Symposium on Information Theory (ISIT), 2023.

• Rate-Optimal Streaming Codes with Smaller Field Size Under Less-Stringent Decoding-Delay Requirements

Shobhit Bhatnagar, Vinayak Ramkumar, and P. Vijay Kumar

IEEE Information Theory Workshop (ITW), 2022.

• On Information-Debt-Optimal Streaming Codes With Small Memory

Vinayak Ramkumar, M. Nikhil Krishnan, Myna Vajha, and P. Vijay Kumar

IEEE International Symposium on Information Theory (ISIT), 2022.

• Locally Recoverable Streaming Codes for Packet-Erasure Recovery

Vinayak Ramkumar, Myna Vajha, and P. Vijay Kumar 

IEEE Information Theory Workshop (ITW), 2021.

• On the Performance Analysis of Streaming Codes over the Gilbert-Elliott Channel

Myna Vajha, Vinayak Ramkumar, Mayank Jhamtani, and P. Vijay Kumar 

IEEE Information Theory Workshop (ITW), 2021.

• Generalized Simple Streaming Codes from MDS Codes

Vinayak Ramkumar, Myna Vajha, and P. Vijay Kumar

IEEE International Symposium on Information Theory (ISIT), 2021.

• Explicit Rate-Optimal Streaming Codes with Smaller Field Size

Myna Vajha, Vinayak Ramkumar, M. Nikhil Krishnan, and P. Vijay Kumar

IEEE International Symposium on Information Theory (ISIT), 2021.

• Staggered Diagonal Embedding Based Linear Field Size Streaming Codes

Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan, and P. Vijay Kumar

IEEE International Symposium on Information Theory (ISIT), 2020.

• Coded MapReduce Schemes Based on Placement Delivery Array

Vinayak Ramkumar and P. Vijay Kumar

IEEE International Symposium on Information Theory (ISIT), 2019.

• Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code

Vinayak Ramkumar, Myna Vajha, and P. Vijay Kumar

National Conference on Communications (NCC), 2018.

• Clay codes: Moulding MDS codes to yield an MSR code

Myna Vajha, Vinayak Ramkumar, Bhagyashree Puranik, Ganesh Kini, Elita Lobo, Birenjith Sasidharan, 

P. Vijay Kumar, Alexandar Barg, Min Ye, Srinivasan Narayanamurthy, Syed Hussain, and Siddhartha Nandi

USENIX Conference on File and Storage Technologies (FAST), 2018.

• Binary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval

Myna Vajha, Vinayak Ramkumar, and P. Vijay Kumar

IEEE International Symposium on Information Theory (ISIT), 2017.

Under Review

• Perfect Subset Privacy in Polynomial Computation via Reed-Muller Information Super-sets

Zirui (Ken) Deng, Vinayak Ramkumar, and Netanel Raviv

Submitted to IEEE Transactions on Information Theory. 

• Small Field Size Streaming Code Constructions

Shobhit Bhatnagar, Vinayak Ramkumar, and P. Vijay Kumar.

Submitted to IEEE Transactions on Information Theory. 

• On MDS Convertible Codes in the Merge Regime

Vinayak Ramkumar, Xiangliang Kong, G. Yeswanth Sai, Myna Vajha, and M. Nikhil Krishnan

Submitted to IEEE Transactions on Information Theory. 

Invited Talks

• CSS Quantum Codes 101

COD Seminar, June 2025, TU Munich. 

• Access-Redundancy Tradeoffs in Quantized Linear Computations

Coding Seminar, May 2024, Technion.

• Access-Redundancy Tradeoffs in Quantized Linear Computations

CSE Colloquia Series, October 2023, Washington University in St. Louis.

• Tutorial on Streaming Codes

Jointly with P. Vijay Kumar, Nikhil Krishnan, and Myna Vajha

National Conference on Communications, July 2021, IIT Kanpur (virtual).

Posters

• Codes for Storage of Information in the DNA of Living Organisms

Tuller-con 2024, July 2024, Tel Aviv University.

• Coded Private Information Retrieval and Coded Computation

NetApp University Day, Match 2021, NetApp Bangalore.

• Joint winner of Qualcomm Innovation Fellowship India 2021

• Prof. F. M. Mowdawalla Medal (2017-18) for the best M.Sc. Engg. Thesis in ECE, IISc

• Reviewer for IEEE Transactions on Information Theory, IEEE Transactions on Communications, IEEE Communications Letters, Designs Codes and Cryptography, IEEE Journal on Selected Areas in Information Theory, International Symposium on Information Theory, Information Theory Workshop