default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. K. Krishnan Namboodiri
Person information
- affiliation: Indian Institute of Science (IISc), Department of Electrical Communication Engineering, Bangalore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j4]Elizabath Peter
, K. K. Krishnan Namboodiri, B. Sundar Rajan:
Coded Caching With Shared Caches and Private Caches. IEEE Trans. Commun. 72(8): 4857-4872 (2024)- [j3]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-Off With Coded Placement. IEEE Trans. Inf. Theory 70(3): 1787-1805 (2024) - 2023
- [j2]K. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan:
Extended Placement Delivery Arrays for Multi-Antenna Coded Caching Scheme. IEEE Trans. Commun. 71(10): 5647-5660 (2023) - 2022
- [j1]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Improved Lower Bounds for Multi-Access Coded Caching. IEEE Trans. Commun. 70(7): 4454-4468 (2022)
Conference and Workshop Papers
- 2024
- [c11]Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan:
Multi-Antenna Coded Caching for Multi-Access Networks with Cyclic Wrap-Around. WCNC 2024: 1-6 - 2023
- [c10]Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan:
Coded Caching with Shared Caches and Private Caches. ITW 2023: 119-124 - [c9]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-off with Coded Placement. ITW 2023: 159-164 - 2022
- [c8]Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan:
A Secretive Coded Caching for Shared Cache Systems using Placement Delivery Arrays. ISIT 2022: 1402-1407 - [c7]K. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan:
Extended Placement Delivery Arrays for Multi-Antenna Coded Caching Scheme. ISIT 2022: 1518-1523 - [c6]K. K. Krishnan Namboodiri, B. Sundar Rajan:
An Improved Lower Bound for Multi-Access Coded Caching. ISIT 2022: 1713-1718 - [c5]Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan:
Shared Cache Coded Caching Schemes with known User-to-Cache Association Profile using Placement Delivery Arrays. ITW 2022: 678-683 - [c4]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Multi-Access Coded Caching with Coded Placement. WCNC 2022: 2274-2279 - [c3]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Multi-Access Coded Caching with Demand Privacy. WCNC 2022: 2280-2285 - 2021
- [c2]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Optimal Demand Private Coded Caching for Users with Small Buffers. ISIT 2021: 706-711 - [c1]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Multi-Access Coded Caching with Secure Delivery. ITW 2021: 1-6
Informal and Other Publications
- 2024
- [i13]K. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan:
Two-Dimensional Multi-Access Coded Caching with Multiple Transmit Antennas. CoRR abs/2405.02683 (2024) - [i12]K. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan:
Placement Delivery Arrays for Coded Caching with Shared and Private Caches. CoRR abs/2405.02687 (2024) - [i11]Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan:
Wireless MapReduce Arrays for Coded Distributed Computing. CoRR abs/2406.15791 (2024) - 2023
- [i10]Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan:
Multi-Antenna Coded Caching for Multi-Access Networks with Cyclic Wrap-Around. CoRR abs/2310.08894 (2023) - 2022
- [i9]K. K. Krishnan Namboodiri, B. Sundar Rajan:
An Improved Lower Bound for Multi-Access Coded Caching. CoRR abs/2201.09127 (2022) - [i8]Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan:
Shared Cache Coded Caching Schemes with known User-to-Cache Association Profile using Placement Delivery Arrays. CoRR abs/2201.10577 (2022) - [i7]K. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan:
Extended Placement Delivery Arrays for Multi-Antenna Coded Caching Scheme. CoRR abs/2201.10585 (2022) - [i6]Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan:
Coded Caching with Shared Caches and Private Caches. CoRR abs/2209.00299 (2022) - [i5]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-off with Coded Placement. CoRR abs/2212.12686 (2022) - 2021
- [i4]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Optimal Demand Private Coded Caching for Users with Small Buffers. CoRR abs/2101.08745 (2021) - [i3]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Multi-Access Coded Caching with Secure Delivery. CoRR abs/2105.05611 (2021) - [i2]K. K. Krishnan Namboodiri, B. Sundar Rajan:
Multi-Access Coded Caching with Demand Privacy. CoRR abs/2107.00226 (2021) - [i1]Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan:
A Secretive Coded Caching for Shared Cache Systems using PDAs. CoRR abs/2110.11110 (2021)
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-09-10 01:13 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:
