Follow
V. Arvind Rameshwar
V. Arvind Rameshwar
PhD Student, Indian Institute of Science, Bengaluru
Verified email at iisc.ac.in
Title
Cited by
Cited by
Year
On maximally recoverable codes for product topologies
D Shivakrishna, VA Rameshwar, V Lalitha, B Sasidharan
2018 Twenty Fourth National Conference on Communications (NCC), 1-6, 2018
72018
Computable lower bounds for capacities of input-driven finite-state channels
VA Rameshwar, N Kashyap
2020 IEEE International Symposium on Information Theory (ISIT), 2002-2007, 2020
62020
Dynamic rank-maximal and popular matchings
P Nimbhorkar, VA Rameshwar
Journal of Combinatorial Optimization 37, 523-545, 2019
62019
Coding Schemes Based on Reed-Muller Codes for (d,∞)-RLL Input-Constrained Channels
VA Rameshwar, N Kashyap
IEEE Transactions on Information Theory, 2023
42023
On the performance of Reed-Muller codes over (d,∞)-RLL input-constrained BMS channels
VA Rameshwar, N Kashyap
2022 IEEE International Symposium on Information Theory (ISIT), 1755-1760, 2022
42022
Estimating the sizes of binary error-correcting constrained codes
VA Rameshwar, N Kashyap
IEEE Journal on Selected Areas in Information Theory, 2023
32023
Linear runlength-limited subcodes of Reed-Muller codes and coding schemes for input-constrained BMS channels
VA Rameshwar, N Kashyap
2022 IEEE Information Theory Workshop (ITW), 624-629, 2022
22022
Numerically computable lower bounds on the capacity of the (1,∞)-RLL input-constrained binary erasure channel
VA Rameshwar, N Kashyap
2021 National Conference on Communications (NCC), 1-6, 2021
22021
Bounds on the Feedback Capacity of the ()-RLL Input-Constrained Binary Erasure Channel
VA Rameshwar, N Kashyap
2021 IEEE International Symposium on Information Theory (ISIT), 290-295, 2021
22021
Achieving secrecy capacity of minimum storage regenerating codes for all feasible (n, k, d) parameter values
VA Rameshwar, N Kashyap
2019 National Conference on Communications (NCC), 1-6, 2019
22019
Sampling-based estimates of the sizes of constrained subcodes of Reed-Muller codes
VA Rameshwar, S Jain, N Kashyap
2024 National Conference on Communications (NCC), 1-6, 2024
12024
Effect of longitudinal and shear stress on photonic crystal based ring resonator
VA Rameshwar, D Aditya, M Balasubramanian, UP Lakshmi, PK Pattnaik
2018 3rd International Conference on Microwave and Photonics (ICMAP), 1-2, 2018
12018
Dynamic rank-maximal matchings
P Nimbhorkar, A Rameshwar V
International Computing and Combinatorics Conference, 433-444, 2017
12017
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling
S Jain, VA Rameshwar, N Kashyap
arXiv preprint arXiv:2403.05893, 2024
2024
Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets
VA Rameshwar, A Tandon, P Gupta, N Chakraborty, A Sharma
arXiv preprint arXiv:2401.15906, 2024
2024
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes
V Arvind Rameshwar, S Jain, N Kashyap
arXiv e-prints, arXiv: 2309.08907, 2023
2023
A Version of Delsarte's Linear Program for Constrained Systems
VA Rameshwar, N Kashyap
2023 IEEE International Symposium on Information Theory (ISIT), 30-35, 2023
2023
Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions
VA Rameshwar, N Kashyap
2023 IEEE International Symposium on Information Theory (ISIT), 2667-2672, 2023
2023
Estimating the Sizes of Binary Error-Correcting Constrained Codes
V Arvind Rameshwar, N Kashyap
arXiv e-prints, arXiv: 2301.05098, 2023
2023
Coding Schemes Based on Reed-Muller Codes for -RLL Input-Constrained Channels
VA Rameshwar, N Kashyap
arXiv preprint arXiv:2211.05513, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–20