pith. sign in

V. Arvind Rameshwar

Identifiers

  • name variant V. Arvind Rameshwar 0.60 · backfill

Papers (18)

  1. $(\ell,\delta)$-Diversity: Linkage-Robustness via a Composition Theorem cs.IT · 2025 · author #1
  2. On Achievable Rates Over Noisy Nanopore Channels cs.IT · 2025 · author #1
  3. An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC cs.IT · 2024 · author #1
  4. Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs cs.IT · 2024 · author #1
  5. Information Rates Over Multi-View Channels cs.IT · 2024 · author #1
  6. On Improving the Composition Privacy Loss in Differential Privacy for Fixed Estimation Error cs.CR · 2024 · author #1
  7. Estimating the Weight Enumerators of Reed-Muller Codes via Sampling cs.IT · 2024 · author #2
  8. Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets cs.CR · 2024 · author #1
  9. Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes cs.IT · 2023 · author #1
  10. Estimating the Sizes of Binary Error-Correcting Constrained Codes cs.IT · 2023 · author #1
  11. Coding Schemes Based on Reed-Muller Codes for $(d,\infty)$-RLL Input-Constrained Channels cs.IT · 2022 · author #1
  12. Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels cs.IT · 2022 · author #1
  13. A Feedback Capacity-Achieving Coding Scheme for the $(d,\infty)$-RLL Input-Constrained Binary Erasure Channel cs.IT · 2022 · author #1
  14. On the Performance of Reed-Muller Codes Over $(d,\infty)$-RLL Input-Constrained BMS Channels cs.IT · 2022 · author #1
  15. Bounds on the Feedback Capacity of the $(d,\infty)$-RLL Input-Constrained Binary Erasure Channel cs.IT · 2021 · author #1
  16. Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels cs.IT · 2020 · author #1
  17. Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible $(n, k, d)$ Parameter Values cs.IT · 2019 · author #1
  18. On Maximally Recoverable Codes for Product Topologies cs.IT · 2018 · author #2

Mentions

  • 2506.18405 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2412.08129 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2501.02917 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2405.06261 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2409.18573 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2405.07264 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2401.15906 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2403.05893 #2 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2309.08907 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2211.05513 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2301.05098 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2205.04153 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2204.06780 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2201.02035 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2101.08638 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 2001.03423 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 1902.09865 #1 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar
  • 1801.03379 #2 · arxiv_oai · confidence 0.70 V. Arvind Rameshwar

Frequent Coauthors