V Arvind Rameshwar

According to our database, V Arvind Rameshwar authored at least 23 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs.

V Arvind Rameshwar, Anshoo Tandon, Abhay Sharma

CoRR, 2024

Information Rates Over Multi-View Channels.

V Arvind Rameshwar, Nir Weinberger

CoRR, 2024

Improving the Privacy Loss Under User-Level DP Composition for Fixed Estimation Error.

V Arvind Rameshwar, Anshoo Tandon

CoRR, 2024

Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets.

V Arvind Rameshwar, Anshoo Tandon, Prajjwal Gupta, Novoneel Chakraborty, Abhay Sharma

CoRR, 2024

Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets.

Prajjwal Gupta, V Arvind Rameshwar, Anshoo Tandon, Novoneel Chakraborty

Proceedings of the International Conference on Signal Processing and Communications, 2024

Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes.

V Arvind Rameshwar, Shreyas Jain, Navin Kashyap

Proceedings of the National Conference on Communications, 2024

Information Rates Over DMCs with Many Independent Views.

V Arvind Rameshwar, Nir Weinberger

Proceedings of the IEEE International Symposium on Information Theory, 2024

Estimating the Weight Enumerators of Reed-Muller Codes via Sampling.

Shreyas Jain, V Arvind Rameshwar, Navin Kashyap

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels.

V Arvind Rameshwar, Navin Kashyap

IEEE Trans. Inf. Theory, November, 2023

Estimating the Sizes of Binary Error-Correcting Constrained Codes.

V Arvind Rameshwar, Navin Kashyap

IEEE J. Sel. Areas Inf. Theory, 2023

Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions.

V Arvind Rameshwar, Navin Kashyap

Proceedings of the IEEE International Symposium on Information Theory, 2023

A Version of Delsarte's Linear Program for Constrained Systems.

V Arvind Rameshwar, Navin Kashyap

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel.

V Arvind Rameshwar, Navin Kashyap

Proceedings of the IEEE International Conference on Signal Processing and Communications, 2022

Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels.

V Arvind Rameshwar, Navin Kashyap

Proceedings of the IEEE Information Theory Workshop, 2022

On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels.

V Arvind Rameshwar, Navin Kashyap

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Bounds on the Feedback Capacity of the (d, ∞)-RLL Input-Constrained Binary Erasure Channel.

V Arvind Rameshwar, Navin Kashyap

CoRR, 2021

Bounds on the Feedback Capacity of the ($d, \infty$)-RLL Input-Constrained Binary Erasure Channel.

V Arvind Rameshwar, Navin Kashyap

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

On the Capacity of the Flash Memory Channel with Feedback.

V Arvind Rameshwar, Aryabhatt M. Reghu, Navin Kashyap

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels.

V Arvind Rameshwar, Navin Kashyap

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Dynamic rank-maximal and popular matchings.

Prajakta Nimbhorkar, V Arvind Rameshwar

J. Comb. Optim., 2019

Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values.

V Arvind Rameshwar, Navin Kashyap

Proceedings of the National Conference on Communications, 2019

2018

On Maximally Recoverable Codes for Product Topologies.

D. Shivakrishna, V Arvind Rameshwar, V. Lalitha, Birenjith Sasidharan

CoRR, 2018

2017

Dynamic Rank-Maximal Matchings.

Prajakta Nimbhorkar, V Arvind Rameshwar

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017