Skip to content

V Arvind Rameshwar

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

17

Venues

5

Active years

2017–2026

Best venue rank

B

Where they publish

Papers

17 indexed papers, newest first.

YearVenueTitleAuthors
2026ISITOn the Error Probability of RPA Decoding of Reed-Muller Codes over BMS Channels.Dorsa Fathollahi, V Arvind Rameshwar, V. Lalitha
2026ISITBounding User Contributions for User-Level Differentially Private Mean Estimation.V Arvind Rameshwar, Anshoo Tandon
2025COMSNETSOptimal Tree-Based Mechanisms for Differentially Private Approximate CDFs.V Arvind Rameshwar, Anshoo Tandon, Abhay Sharma
2025ISITAn Upper Bound on the Error Probability of Rpa Decoding of Reed-Muller Codes Over the Bsc.V Arvind Rameshwar, V. Lalitha
2025ISITImproving the Privacy Loss Under User-Level DP Composition for Fixed Estimation Error.V Arvind Rameshwar, Anshoo Tandon, Abhay Sharma
2025ITWOn Achievable Rates Over Noisy Nanopore Channels.V Arvind Rameshwar, Nir Weinberger
2024ISITEstimating the Weight Enumerators of Reed-Muller Codes via Sampling.Shreyas Jain, V Arvind Rameshwar, Navin Kashyap
2024ISITInformation Rates Over DMCs with Many Independent Views.V Arvind Rameshwar, Nir Weinberger
2024ITWOn the Expected Number of Views Required for Fixed-Error Sequence Reconstruction.Vivian Papadopoulou, V Arvind Rameshwar, Antonia Wachter-Zeh
2023ISITA Version of Delsarte's Linear Program for Constrained Systems.V Arvind Rameshwar, Navin Kashyap
2023ISITCounting Constrained Codewords in Binary Linear Codes via Fourier Expansions.V Arvind Rameshwar, Navin Kashyap
2022ISITOn the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels.V Arvind Rameshwar, Navin Kashyap
2022ITWLinear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels.V Arvind Rameshwar, Navin Kashyap
2021ISITBounds on the Feedback Capacity of the ($d, \infty$)-RLL Input-Constrained Binary Erasure Channel.V Arvind Rameshwar, Navin Kashyap
2020ISITComputable Lower Bounds for Capacities of Input-Driven Finite-State Channels.V Arvind Rameshwar, Navin Kashyap
2020ISITAOn the Capacity of the Flash Memory Channel with Feedback.V Arvind Rameshwar, Aryabhatt M. Reghu, Navin Kashyap
2017COCOONDynamic Rank-Maximal Matchings.Prajakta Nimbhorkar, V Arvind Rameshwar