default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnoop Thomas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Monolina Dutta
, Anoop Thomas:
Decentralized coded caching for shared caches using erasure coding. Phys. Commun. 62: 102242 (2024)- [c16]Raj Shah, Utsav Tiwari, Anoop Thomas:
Tree Gradient Coding Considering Communication Delays and Partial Stragglers. ICC 2024: 1986-1991 - 2023
- [c15]M. Nikhil Krishnan, Anoop Thomas, Birenjith Sasidharan:
Hierarchical Coded Gradient Aggregation Based on Layered MDS Codes. ISIT 2023: 2547-2552 - [i10]M. Nikhil Krishnan, Anoop Thomas, Birenjith Sasidharan:
Hierarchical Coded Gradient Aggregation Based on Layered MDS Codes. CoRR abs/2311.14116 (2023) - 2022
- [j8]Birenjith Sasidharan, Anoop Thomas:
Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes. IEEE J. Sel. Areas Commun. 40(3): 761-772 (2022) - [c14]Apurve K. Pandey, Monolina Dutta, Anoop Thomas:
Decentralized Coded Caching for Shared Caches using Erasure Coding. ITW 2022: 172-177 - [i9]Monolina Dutta, Anoop Thomas, B. Sundar Rajan:
Multi-access Coded Caching with Decentralized Prefetching. CoRR abs/2203.16845 (2022) - 2021
- [j7]Monolina Dutta, Anoop Thomas:
Decentralized Coded Caching for Shared Caches. IEEE Commun. Lett. 25(5): 1458-1462 (2021) - [c13]Ela Bhattacharya, Utsav Tiwari, Raj Shah, Anoop Thomas:
Improved Tree Gradient Coding with Non-uniform Computation Load. ICC 2021: 1-6 - [c12]Birenjith Sasidharan, Anoop Thomas:
Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes. ISIT 2021: 2286-2291 - [c11]Pruthvi Trinadh, Monolina Dutta, Anoop Thomas, B. Sundar Rajan:
Decentralized Multi-access Coded Caching with Uncoded Prefetching. ITW 2021: 1-6 - [i8]Birenjith Sasidharan, Anoop Thomas:
Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes. CoRR abs/2105.02919 (2021) - 2020
- [j6]Anoop Thomas, Balaji Sundar Rajan:
Generalized Index Coding Problem and Discrete Polymatroids. Entropy 22(6): 646 (2020) - [j5]Nujoom Sageer Karat, Anoop Thomas, Balaji Sundar Rajan:
Optimal Linear Error Correcting Delivery Schemes for Two Optimal Coded Caching Schemes. Entropy 22(7): 766 (2020) - [c10]Sonu Rathi, Anoop Thomas, Monolina Dutta:
An Optimal Linear Error Correcting Scheme for Shared Caching with Small Cache Sizes. ISIT 2020: 1670-1674
2010 – 2019
- 2019
- [j4]Anoop Thomas, B. Sundar Rajan:
A Discrete Polymatroidal Framework for Differential Error-Correcting Index Codes. IEEE Trans. Commun. 67(7): 4593-4604 (2019) - [j3]Nujoom Sageer Karat, Anoop Thomas, B. Sundar Rajan:
Error Correction in Coded Caching With Symmetric Batch Prefetching. IEEE Trans. Commun. 67(8): 5264-5274 (2019) - [c9]Nujoom Sageer Karat, Spandan Dey, Anoop Thomas, B. Sundar Rajan:
An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches. ISIT 2019: 1217-1221 - [i7]Nujoom Sageer Karat, Spandan Dey, Anoop Thomas, B. Sundar Rajan:
An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches. CoRR abs/1901.03188 (2019) - 2018
- [j2]Anoop Thomas, B. Sundar Rajan:
Binary Informed Source Codes and Index Codes Using Certain Near-MDS Codes. IEEE Trans. Commun. 66(5): 2181-2190 (2018) - [c8]Nujoom Sageer Karat, Anoop Thomas, B. Sundar Rajan:
Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers. ISIT 2018: 1710-1714 - [c7]Nujoom Sageer Karat, Anoop Thomas, B. Sundar Rajan:
Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching. ISIT 2018: 2092-2096 - [i6]Nujoom Sageer Karat, Anoop Thomas, B. Sundar Rajan:
Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers. CoRR abs/1801.02061 (2018) - 2017
- [j1]Anoop Thomas, Kavitha Radhakumar, Chandramouli Attada, B. Sundar Rajan:
Single Uniprior Index Coding With Min-Max Probability of Error Over Fading Channels. IEEE Trans. Veh. Technol. 66(7): 6050-6059 (2017) - [c6]Anoop Thomas, B. Sundar Rajan:
Index Coding with Restricted Information (ICRI) and Interference Alignment. GLOBECOM 2017: 1-7 - [c5]Anoop Thomas, B. Sundar Rajan:
Binary index codes using l-th NMDS codes. ICC 2017: 1-6 - [c4]Anoop Thomas, B. Sundar Rajan:
Generalized index coding problem and discrete polymatroids. ISIT 2017: 2553-2557 - [i5]Anoop Thomas, B. Sundar Rajan:
Generalized Index Coding Problem and Discrete Polymatroids. CoRR abs/1701.03559 (2017) - [i4]Nujoom Sageer Karat, Anoop Thomas, B. Sundar Rajan:
Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching. CoRR abs/1712.08113 (2017) - 2015
- [c3]Anoop Thomas, B. Sundar Rajan:
Error correcting index codes and matroids. ISIT 2015: 1029-1033 - [c2]Anoop Thomas, B. Sundar Rajan:
Vector linear error correcting index codes and discrete polymatroids. ISIT 2015: 1039-1043 - [c1]Anoop Thomas, R. Kavitha, A. Chandramouli, B. Sundar Rajan:
Optimal index coding with min-max probability of error over fading channels. PIMRC 2015: 889-894 - [i3]Anoop Thomas, B. Sundar Rajan:
Error Correcting Index Codes and Matroids. CoRR abs/1501.05060 (2015) - [i2]Anoop Thomas, B. Sundar Rajan:
Vector Linear Error Correcting Index Codes and Discrete Polymatroids. CoRR abs/1504.04960 (2015) - 2014
- [i1]Anoop Thomas, R. Kavitha, A. Chandramouli, B. Sundar Rajan:
Optimal Index Coding with Min-Max Probability of Error over Fading Channels. CoRR abs/1410.6038 (2014)
Coauthor Index
aka: Balaji Sundar Rajan
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-09-04 01: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:
