Publications

Disclaimer: Copyright belongs to the publisher in the case of published articles. Copyright belongs to the author/authors in all other cases.

As Full Papers in Journals or Conferences

  1. V. Arvind Rameshwar, Anshoo Tandon, Abhay Sharma, “Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs,” under review at the IEEE Transactions on Information Forensics and Security, Oct. 2024. [arXiv]

  2. V. Arvind Rameshwar and Anshoo Tandon, “Improving the privacy loss under user-level DP composition for fixed estimation error,” under review at the IEEE Transactions on Information Theory, Aug. 2024. [arXiv]

  3. V. Arvind Rameshwar and Nir Weinberger, “Information rates over multi-view channels,” under review at the IEEE Transactions on Information Theory, May 2024. [arXiv]

  4. V. Arvind Rameshwar, Shreyas Jain, and Navin Kashyap, “Sampling-based estimates of the weight enumerators of Reed-Muller codes,” under review at the IEEE Transactions on Communications, Sep. 2024. [arXiv]

  5. V. Arvind Rameshwar, Anshoo Tandon, Prajjwal Gupta, Aditya Vikram Singh, Novoneel Chakraborty, and Abhay Sharma, “Mean estimation with user-level privacy for spatio-temporal IoT datasets,” under review at the ACM Transactions on Privacy and Security, Apr. 2024. [arXiv]

  6. V. Arvind Rameshwar and Navin Kashyap, “Estimating the sizes of binary error-correcting constrained codes,” in IEEE Journal on Selected Areas in Information Theory, vol. 4, pp. 144-158, 2023, doi: 10.1109/JSAIT.2023.3279113. [IEEE Xplore][arXiv]

  7. V. Arvind Rameshwar and Navin Kashyap, “Coding schemes based on Reed-Muller codes for $(d,\infty)$-RLL input-constrained channels,” in IEEE Transactions on Information Theory, vol. 69, no. 11, pp. 7003-7024, Nov. 2023, doi: 10.1109/TIT.2023.3296207. [IEEE Xplore][arXiv]

  8. Prajakta Nimbhorkar and V. Arvind Rameshwar, “Dynamic rank-maximal and popular matchings,” Journal of Combinatorial Optimization, vol. 37, no. 2, pp. 523–545, 2019. [SpringerLink]

As Short Conference Papers

  1. Vivian Papadopoulou, V. Arvind Rameshwar, Antonia Wachter-Zeh, “How Many Noisy Copies of a Sequence are Needed on Average for Exact Reconstruction?,” accepted to the 2024 IEEE Information Theory Workshop (ITW), Shenzhen, China.

  2. V. Arvind Rameshwar and Nir Weinberger, “Information rates over DMCs with many independent views,” 2024 IEEE International Symposium on Information Theory (ISIT), Athens, Greece. [arXiv full version] [IEEE Xplore]

  3. Shreyas Jain, V. Arvind Rameshwar, and Navin Kashyap, “Estimating the weight enumerators of Reed-Muller codes via sampling,” 2024 IEEE International Symposium on Information Theory (ISIT), Athens, Greece. [arXiv] [IEEE Xplore]

  4. Prajjwal Gupta, V. Arvind Rameshwar, Anshoo Tandon, Novoneel Chakraborty, “Mean estimation with user-level privacy for spatio-temporal IoT datasets,” 2024 IEEE International Conference on Signal Processing and Communications (SPCOM). Finalist for a Best Paper Award. [arXiv full version] [IEEE Xplore]

  5. V. Arvind Rameshwar, Shreyas Jain, and Navin Kashyap, “Sampling-based estimates of the sizes of constrained subcodes of Reed-Muller codes,” 30th National Conference on Communications (NCC) 2024. Recipient of a Best Paper Award. [arXiv full version] [IEEE Xplore]

  6. V. Arvind Rameshwar and Navin Kashyap, “A version of Delsarte’s linear program for constrained systems,” 2023 IEEE International Symposium on Information Theory (ISIT). Recipient of a Jack Keil Wolf ISIT Student Paper Award. [arXiv full version] [IEEE Xplore]

  7. V. Arvind Rameshwar and Navin Kashyap, “Counting constrained codewords in binary linear codes via Fourier expansions,” 2023 IEEE International Symposium on Information Theory (ISIT). [arXiv full version] [IEEE Xplore]

  8. V. Arvind Rameshwar and Navin Kashyap, “Linear runlength-limited subcodes of Reed-Muller codes and coding schemes for input-constrained BMS channels,” 2022 IEEE Information Theory Workshop (ITW). [IEEE Xplore][arXiv full version]

  9. V. Arvind Rameshwar and Navin Kashyap, “A feedback capacity-achieving coding scheme for the $(d,\infty)$-RLL input-constrained binary erasure channel,” 2022 IEEE International Conference on Signal Processing and Communications (SPCOM). Recipient of a Best Student Paper Award. [IEEE Xplore][arXiv full version]

  10. V. Arvind Rameshwar and Navin Kashyap, “On the performance of Reed-Muller codes Over $(d,\infty)$-RLL input-constrained BMS channels,” 2022 International Symposium on Information Theory (ISIT), Espoo, Finland, Jun. 2022. [IEEE Xplore][arXiv full version]

  11. V. Arvind Rameshwar and Navin Kashyap, “Numerically computable lower bounds on the capacity of the $(1,\infty)$-RLL input-constrained binary erasure channel,” National Conference on Communications (NCC), 2021. Recipient of a Best Paper Award. [IEEE Xplore]

  12. V. Arvind Rameshwar and Navin Kashyap, “Bounds on the feedback capacity of the $(d,\infty)$-RLL input-constrained binary erasure channel,” accepted to the International Symposium on Information Theory (ISIT) 2021. [arXiv full version][IEEE Xplore]

  13. V. Arvind Rameshwar, Aryabhatt M. Reghu, and Navin Kashyap, “On the capacity of the flash memory channel with feedback,” in 2020 International Symposium on Information Theory and its Applications (ISITA2020), Kapolei, USA, Oct. 2020. [IEEE Xplore]

  14. V. Arvind Rameshwar and Navin Kashyap, “Computable lower bounds for capacities of input-driven finite-state channels,” in Proc. 2020 International Symposium on Information Theory (ISIT 2020), Los Angeles, California, USA, Jun. 21–26, 2020. [arXiv full version]

  15. V. Arvind Rameshwar and Navin Kashyap, “Achieving secrecy capacity of minimum storage regenerating codes for all feasible $(n,k,d)$ parameter values,” in 2019 National Conference on Communications (NCC), pp. 1–6, 2019. Finalist for a Best Paper Award. [arXiv][IEEE Xplore]

  16. V. Arvind Rameshwar, Dusi Aditya, M. Balasubramanian, U. Poorna Lakshmi, and Prasant Kumar Pattnaik, “Effect of longitudinal and shear stress on photonic crystal-based ring resonator,” in 2018 3rd International Conference on Microwave and Photonics (ICMAP), pp. 1–2, Feb. 2018. [IEEE Xplore]

  17. D. Shivakrishna, V. Arvind Rameshwar, Vadlamani Lalitha, and Birenjith Sasidharan, “On maximally recoverable codes for product topologies,” in 2018 Twenty Fourth National Conference on Communications (NCC), pp. 1–6, Feb. 2018. [arXiv][IEEE Xplore]

  18. Prajakta Nimbhorkar and V. Arvind Rameshwar, “Dynamic rank-maximal matchings,” in Computing and Combinatorics – 23rd International Conference, COCOON 2017, Hong Kong, China, August 3–5, 2017, Proceedings (Y. Cao and J. Chen, eds.), vol. 10392 of Lecture Notes in Computer Science, pp. 433–444, Springer, 2017. [arXiv full version]

As Posters in Workshops

  1. Vivian Papadopoulou, V. Arvind Rameshwar, Antonia Wachter-Zeh, “On Exact Sequence Reconstruction Over a Stochastic $t$-Error Channel,” accepted to the Workshop on Coding Theory and Algorithms for DNA-based Data Storage at the ISIT 2024. [abstract]

  2. V. Arvind Rameshwar, Anshoo Tandon, Abhay Sharma, “User-Level Differentially Private Mean Estimation for Real-World Datasets,” accepted to the ISIT 2024 Workshop on Information-Theoretic Methods for Trustworthy Machine Learning (IT-TML). [full version]

  3. Vivian Papadopoulou, V. Arvind Rameshwar, Antonia Wachter-Zeh, “Sequence Reconstruction over Exact-$t$ Adversarial Channel Repetitions: An Average Case Analysis,” in Munich Workshop on Coding and Cryptography 2024. [poster]

As Unpublished Preprints