default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShivaprasad Kotagiri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j4]Shivaprasad Kotagiri, J. Nicholas Laneman:
Variations on information embedding in multiple access and broadcast channels. IEEE Trans. Inf. Theory 56(5): 2225-2240 (2010)- [j3]Abdellatif Zaidi, Shivaprasad Kotagiri, J. Nicholas Laneman, Luc Vandendorpe:
Cooperative relaying with state available noncausally at the relay. IEEE Trans. Inf. Theory 56(5): 2272-2298 (2010)
2000 – 2009
- 2009
- [j2]Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman:
On downlink transmission without transmit channel state information and with outage constraints. IEEE Trans. Inf. Theory 55(9): 4240-4248 (2009) - [c6]Abdellatif Zaidi, Luc Vandendorpe, Shivaprasad Kotagiri, J. Nicholas Laneman:
Multiaccess channels with state known to one encoder: Another case of degraded message sets. ISIT 2009: 2376-2380 - [i7]Abdellatif Zaidi, Shivaprasad Kotagiri, J. Nicholas Laneman, Luc Vandendorpe:
Multiaccess Channels with State Known to One Encoder: Another Case of Degraded Message Sets. CoRR abs/0906.1603 (2009) - [i6]Abdellatif Zaidi, Shivaprasad Kotagiri, J. Nicholas Laneman, Luc Vandendorpe:
Cooperative Relaying with State Available Non-Causally at the Relay. CoRR abs/0911.4704 (2009) - 2008
- [j1]Shivaprasad Kotagiri, J. Nicholas Laneman:
Multiaccess Channels with State Known to Some Encoders and Independent Messages. EURASIP J. Wirel. Commun. Netw. 2008 (2008) - [c5]Abdellatif Zaidi, Shivaprasad Kotagiri, J. Nicholas Laneman, Luc Vandendorpe:
Cooperative relaying with state available at the relay. ITW 2008: 139-143 - 2007
- [c4]Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman:
Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels. ISIT 2007: 381-385 - [c3]Shivaprasad Kotagiri, J. Nicholas Laneman:
Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message Sets. ISIT 2007: 1566-1570 - [i5]Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman:
Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels. CoRR abs/0704.2786 (2007) - [i4]Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman:
Outage-Efficient Downlink Transmission Without Transmit Channel State Information. CoRR abs/0711.1573 (2007) - [i3]Shivaprasad Kotagiri, J. Nicholas Laneman:
Variations on Information Embedding in Multiple Access and Broadcast Channels. CoRR abs/0711.2762 (2007) - [i2]Abdellatif Zaidi, Shivaprasad Kotagiri, J. Nicholas Laneman, Luc Vandendorpe:
Cooperative Relaying with State Available at the Relay Only. CoRR abs/0711.4864 (2007) - 2006
- [c2]Shivaprasad Kotagiri, J. Nicholas Laneman:
Information Embedding in Degraded Broadcast Channels. ISIT 2006: 494-498 - [c1]Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman:
Information Transmission over the Postal Channel with and without Feedback. ISIT 2006: 2749-2753 - [i1]Shivaprasad Kotagiri, J. Nicholas Laneman:
Multiple Access Channels with State Information Known at Some Encoders. CoRR abs/cs/0607102 (2006)
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-04-24 23:19 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:
