Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
V. Arvind Rameshwar
Observed names:
Rameshwar, V. Arvind,
V Arvind Rameshwar
Institution:
Indian Institute of Technology Madras
Observed institutions:
Indian Institute of Technology Madras,
Birla Institute of Technology and Science - Hyderabad Campus,
Indian Institute of Science Bangalore,
International Institute of Information Technology, Hyderabad,
Birla Institute of Technology and Science, Pilani
ORCID:
0000-0002-5284-215X
Observed ORCID:
0000-0002-5284-215X
OpenAlex ID:
A5087839421
Information Rates Over Multi-View Channels
2024
·
V. Arvind Rameshwar
, Nir Weinberger
·
IEEE Transactions on Information Theory
·
11
PDF
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling
2024
·
Shreyas Jain
, V. Arvind Rameshwar
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
9
PDF
On Maximally Recoverable Codes for Product Topologies
2018
·
D. Shivakrishna
, V. Arvind Rameshwar
, et al.
·
National Conference on Communications
·
9
PDF
On Achievable Rates Over Noisy Nanopore Channels
2025
·
V. Arvind Rameshwar
, Nir Weinberger
·
IEEE Journal on Selected Areas in Information Theory
·
8
PDF
Dynamic rank-maximal and popular matchings
2018
·
Prajakta Nimbhorkar
, V. Arvind Rameshwar
·
Journal of Combinatorial Optimization
·
8
Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels
2023
·
V. Arvind Rameshwar
, Navin Kashyap
·
IEEE Transactions on Information Theory
·
6
PDF
An Upper Bound on the Error Probability of Rpa Decoding of Reed-Muller Codes Over the Bsc
2025
·
V. Arvind Rameshwar
, V. Lalitha
·
IEEE International Symposium on Information Theory (ISIT)
·
4
On the Expected Number of Views Required for Fixed-Error Sequence Reconstruction
2024
·
Vivian Papadopoulou
, V. Arvind Rameshwar
, et al.
·
IEEE Information Theory Workshop (ITW)
·
4
On Improving the Composition Privacy Loss in Differential Privacy for Fixed Estimation Error
2024
·
Rameshwar, V. Arvind
, Tandon, Anshoo
·
arXiv (Cornell University)
·
4
PDF
Estimating the Sizes of Binary Error-Correcting Constrained Codes
2023
·
V. Arvind Rameshwar
, Navin Kashyap
·
IEEE Journal on Selected Areas in Information Theory
·
4
PDF
Sampling-Based Estimates of the Weight Enumerators of Reed-Muller Codes
2025
·
V. Arvind Rameshwar
, Shreyas Jain
, et al.
·
IEEE Transactions on Communications
·
3
An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC
2024
·
Rameshwar, V. Arvind
, Lalitha, V.
·
arXiv (Cornell University)
·
3
PDF
Bounds on the Feedback Capacity of the ($d, \infty$)-RLL Input-Constrained Binary Erasure Channel
2021
·
V. Arvind Rameshwar
, Navin Kashyap
·
IEEE International Symposium on Information Theory (ISIT)
·
3
PDF
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels
2020
·
V. Arvind Rameshwar
, Navin Kashyap
·
IEEE International Symposium on Information Theory (ISIT)
·
3
PDF
Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs
2025
·
V. Arvind Rameshwar
, Anshoo Tandon
, et al.
·
International Conference on Communication Systems & Networks (COMSNETS)
·
2
Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets
2024
·
Prajjwal Gupta
, V. Arvind Rameshwar
, et al.
·
International Conference on Signal Processing and Communications (SPCOM)
·
2
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes
2024
·
V. Arvind Rameshwar
, Shreyas Jain
, et al.
·
National Conference on Communications
·
2
PDF
On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels
2022
·
V. Arvind Rameshwar
, Navin Kashyap
·
IEEE International Symposium on Information Theory (ISIT)
·
2
PDF
Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values
2019
·
V. Arvind Rameshwar
, Navin Kashyap
·
National Conference on Communications
·
2
PDF
Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs
2026
·
V. Arvind Rameshwar
, Anshoo Tandon
, et al.
·
IEEE Transactions on Information Theory
·
1
PDF
On the Error Probability of RPA Decoding of Reed-Muller Codes over BMS Channels
2026
·
Dorsa Fathollahi
, V. Arvind Rameshwar
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
1
PDF
Information Rates Over DMCs with Many Independent Views
2024
·
V. Arvind Rameshwar
, Nir Weinberger
·
IEEE International Symposium on Information Theory (ISIT)
·
1
PDF
Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels
2022
·
V. Arvind Rameshwar
, Navin Kashyap
·
IEEE Information Theory Workshop (ITW)
·
1
PDF
A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel
2022
·
V. Arvind Rameshwar
, Navin Kashyap
·
International Conference on Signal Processing and Communications (SPCOM)
·
1
PDF
Numerically Computable Lower Bounds on the Capacity of the (1, ∞)-RLL Input-Constrained Binary Erasure Channel
2021
·
V. Arvind Rameshwar
, Navin Kashyap
·
National Conference on Communications
·
1
Show more works
View as search
Works count:
37
Citation count:
102
H-index:
6
I10-index:
1
Year
Topic
Type