default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharul Rajput
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Rajendra Prasad Rajpurohit, Maheshanand Bhaintwal
, Charul Rajput:
Locally maximal recoverable codes and LMR-LCD codes. Des. Codes Cryptogr. 92(10): 2881-2899 (2024)- [j5]Anjana Ambika Mahesh, Charul Rajput, Bobbadi Rupa, B. Sundar Rajan:
Average Probability of Error for Single Uniprior Index Coding Over Binary-Input Continuous-Output Channels. IEEE Trans. Inf. Theory 70(9): 6297-6315 (2024) - [c7]Charul Rajput, B. Sundar Rajan:
Improved Hotplug Caching Scheme Using PDAs. ISIT 2024: 1574-1579 - [c6]Rajlaxmi Pandey, Charul Rajput, B. Sundar Rajan:
Coded Caching for Hierarchical Two-Layer Networks with Coded Placement. ISIT 2024: 2222-2227 - [i7]Megha Rayer, Charul Rajput, B. Sundar Rajan:
Single-Server Pliable Private Information Retrieval with Identifiable Side Information. CoRR abs/2404.04820 (2024) - [i6]Mallikharjuna Chinnapadamala, Charul Rajput, B. Sundar Rajan:
A New Hotplug Coded Caching Scheme Using PDAs. CoRR abs/2404.06433 (2024) - 2023
- [c5]Charul Rajput, B. Sundar Rajan:
On Cache-aided Multi-user Private Information Retrieval with Small Caches. ITW 2023: 153-158 - [c4]Anjana Ambika Mahesh, Charul Rajput, Bobbadi Rupa, B. Sundar Rajan:
Average Probability of Error for Single Uniprior Index Coding over Rayleigh Fading Channel. ITW 2023: 418-423 - [c3]Kakumani Sailahari, Anjana Ambika Mahesh, Charul Rajput, B. Sundar Rajan:
Performance of Maddah-Ali-Niesen Scheme for Multi-Access Coded Caching Over Noisy Channels. PIMRC 2023: 1-7 - [i5]Anjana Ambika Mahesh, Charul Rajput, Bobbadi Rupa, B. Sundar Rajan:
Average Probability of Error for Single Uniprior Index Coding over Rayleigh Fading Channel. CoRR abs/2303.10460 (2023) - [i4]Charul Rajput, B. Sundar Rajan:
Improved Hotplug Caching Schemes Using PDAs and t-Designs. CoRR abs/2311.02856 (2023) - [i3]Rajlaxmi Pandey, Charul Rajput, B. Sundar Rajan:
Coded Caching for Hierarchical Two-Layer Networks with Coded Placement. CoRR abs/2312.15024 (2023) - 2022
- [j4]Charul Rajput, Maheshanand Bhaintwal:
On the locality of quasi-cyclic codes over finite fields. Des. Codes Cryptogr. 90(3): 759-777 (2022) - [c2]Charul Rajput, Maheshanand Bhaintwal:
A subclass of LRC codes with intersecting recovering sets. ITW 2022: 512-516 - [i2]Charul Rajput, B. Sundar Rajan:
On Cache-Aided Multi-User Private Information Retrieval with Small Caches. CoRR abs/2212.12888 (2022) - 2021
- [j3]Charul Rajput, Maheshanand Bhaintwal:
Cyclic LRC-LCD Codes With Hierarchical Locality. IEEE Commun. Lett. 25(3): 711-715 (2021) - 2020
- [j2]Charul Rajput, Maheshanand Bhaintwal:
Optimal RS-like LRC codes of arbitrary length. Appl. Algebra Eng. Commun. Comput. 31(3-4): 271-289 (2020) - [j1]Charul Rajput, Maheshanand Bhaintwal:
RS-like locally recoverable codes with intersecting recovering sets. Finite Fields Their Appl. 68: 101729 (2020) - [c1]Charul Rajput, Maheshanand Bhaintwal, Ramakrishna Bandi:
On cyclic LRC codes that are also LCD codes. ICCCS 2020: 1-5 - [i1]Charul Rajput, Maheshanand Bhaintwal, Ramakrishna Bandi:
On cyclic LRC codes that are also LCD codes. CoRR abs/2011.02805 (2020)
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-16 21:25 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:
