Vinayak Ramkumar

Orcid: 0000-0001-5223-5643

According to our database1, Vinayak Ramkumar authored at least 28 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Access-Redundancy Tradeoffs in Quantized Linear Computations.
IEEE Trans. Inf. Theory, November, 2024

Explicit Rate-Optimal Streaming Codes With Smaller Field Size.
IEEE Trans. Inf. Theory, May, 2024

Quantum Locally Recoverable Codes via Good Polynomials.
CoRR, 2024

ε-MSR Codes for Any Set of Helper Nodes.
CoRR, 2024

On Multi-Path Streaming Codes.
Proceedings of the National Conference on Communications, 2024

Streaming Codes for Three-Node Relay Networks with Burst Erasures.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Non-Binary Covering Codes for Low-Access Computations.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Perfect Subset Privacy in Polynomial Computation.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Private Inference in Quantized Models.
CoRR, 2023

Near-Optimal Streaming Codes with Linear Field Size.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Explicit Information-Debt-Optimal Streaming Codes With Small Memory.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Coefficient Complexity in Low-Access Quantized Linear Computations.
Proceedings of the 59th Annual Allerton Conference on Communication, 2023

2022
Codes for Distributed Storage.
Found. Trends Commun. Inf. Theory, 2022

Rate-Optimal Streaming Codes with Smaller Field Size Under Less-Stringent Decoding-Delay Requirements.
Proceedings of the IEEE Information Theory Workshop, 2022

On Information-Debt-Optimal Streaming Codes With Small Memory.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
On the Performance Analysis of Streaming Codes over the Gilbert-Elliott Channel.
Proceedings of the IEEE Information Theory Workshop, 2021

Locally Recoverable Streaming Codes for Packet-Erasure Recovery.
Proceedings of the IEEE Information Theory Workshop, 2021

Generalized Simple Streaming Codes from MDS Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Simple Streaming Codes for Reliable, Low-Latency Communication.
IEEE Commun. Lett., 2020

Codes for Distributed Storage.
CoRR, 2020

On Sliding Window Approximation of Gilbert-Elliott Channel for Delay Constrained Setting.
CoRR, 2020

Staggered Diagonal Embedding Based Linear Field Size Streaming Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Coded MapReduce Schemes Based on Placement Delivery Array.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code.
CoRR, 2018

Erasure coding for distributed storage: an overview.
Sci. China Inf. Sci., 2018

Clay Codes: Moulding MDS Codes to Yield an MSR Code.
Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018

2017
Binary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval.
CoRR, 2017

Binary, shortened projective reed muller codes for coded private information retrieva.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017


  Loading...