default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDV Arvind Rameshwar 0001
Person information
- affiliation: Indian Institute of Science, Department of Electrical Communication Engineering, Bengaluru
- affiliation (former): Birla Institute of Technology and Science, Hyderabad, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Shreyas Jain, V Arvind Rameshwar
, Navin Kashyap:
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. ISIT 2024: 280-285- [c12]V Arvind Rameshwar, Nir Weinberger:
Information Rates Over DMCs with Many Independent Views. ISIT 2024: 717-722 - [c11]V Arvind Rameshwar, Shreyas Jain, Navin Kashyap:
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes. NCC 2024: 1-6 - [i16]V Arvind Rameshwar, Anshoo Tandon, Prajjwal Gupta, Novoneel Chakraborty, Abhay Sharma:
Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets. CoRR abs/2401.15906 (2024) - [i15]Shreyas Jain, V Arvind Rameshwar, Navin Kashyap:
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. CoRR abs/2403.05893 (2024) - [i14]V Arvind Rameshwar, Anshoo Tandon:
Improving the Privacy Loss Under User-Level DP Composition for Fixed Estimation Error. CoRR abs/2405.06261 (2024) - [i13]V Arvind Rameshwar, Nir Weinberger:
Information Rates Over Multi-View Channels. CoRR abs/2405.07264 (2024) - [i12]V Arvind Rameshwar, Anshoo Tandon, Abhay Sharma:
Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs. CoRR abs/2409.18573 (2024) - 2023
- [j3]V Arvind Rameshwar, Navin Kashyap:
Estimating the Sizes of Binary Error-Correcting Constrained Codes. IEEE J. Sel. Areas Inf. Theory 4: 144-158 (2023) - [j2]V Arvind Rameshwar, Navin Kashyap:
Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels. IEEE Trans. Inf. Theory 69(11): 7003-7024 (2023) - [c10]V Arvind Rameshwar, Navin Kashyap:
A Version of Delsarte's Linear Program for Constrained Systems. ISIT 2023: 30-35 - [c9]V Arvind Rameshwar, Navin Kashyap:
Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions. ISIT 2023: 2667-2672 - [i11]V Arvind Rameshwar, Navin Kashyap:
Estimating the Sizes of Binary Error-Correcting Constrained Codes. CoRR abs/2301.05098 (2023) - [i10]V Arvind Rameshwar, Shreyas Jain, Navin Kashyap:
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes. CoRR abs/2309.08907 (2023) - 2022
- [c8]V Arvind Rameshwar, Navin Kashyap:
On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. ISIT 2022: 1755-1760 - [c7]V Arvind Rameshwar, Navin Kashyap:
Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. ITW 2022: 624-629 - [c6]V Arvind Rameshwar, Navin Kashyap:
A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. SPCOM 2022: 1-5 - [i9]V Arvind Rameshwar, Navin Kashyap:
On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. CoRR abs/2201.02035 (2022) - [i8]V Arvind Rameshwar, Navin Kashyap:
A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. CoRR abs/2204.06780 (2022) - [i7]V Arvind Rameshwar, Navin Kashyap:
Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. CoRR abs/2205.04153 (2022) - [i6]V Arvind Rameshwar, Navin Kashyap:
Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels. CoRR abs/2211.05513 (2022) - 2021
- [c5]V Arvind Rameshwar, Navin Kashyap:
Bounds on the Feedback Capacity of the ($d, \infty$)-RLL Input-Constrained Binary Erasure Channel. ISIT 2021: 290-295 - [i5]V Arvind Rameshwar, Navin Kashyap:
Bounds on the Feedback Capacity of the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. CoRR abs/2101.08638 (2021) - 2020
- [c4]V Arvind Rameshwar, Navin Kashyap:
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. ISIT 2020: 2002-2007 - [c3]V Arvind Rameshwar, Aryabhatt M. Reghu, Navin Kashyap:
On the Capacity of the Flash Memory Channel with Feedback. ISITA 2020: 11-15 - [i4]V Arvind Rameshwar, Navin Kashyap:
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. CoRR abs/2001.03423 (2020)
2010 – 2019
- 2019
- [j1]Prajakta Nimbhorkar, V Arvind Rameshwar:
Dynamic rank-maximal and popular matchings. J. Comb. Optim. 37(2): 523-545 (2019) - [c2]V Arvind Rameshwar, Navin Kashyap:
Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values. NCC 2019: 1-6 - [i3]V Arvind Rameshwar, Navin Kashyap:
Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible $(n, k, d)$ Parameter Values. CoRR abs/1902.09865 (2019) - 2018
- [i2]D. Shivakrishna, V Arvind Rameshwar, V. Lalitha, Birenjith Sasidharan:
On Maximally Recoverable Codes for Product Topologies. CoRR abs/1801.03379 (2018) - 2017
- [c1]Prajakta Nimbhorkar, V Arvind Rameshwar:
Dynamic Rank-Maximal Matchings. COCOON 2017: 433-444 - [i1]Prajakta Nimbhorkar, V Arvind Rameshwar:
Dynamic Rank Maximal Matchings. CoRR abs/1704.00899 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
