default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLennart Gerdes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j4]Lennart Gerdes, Christoph Hellings
, Lorenz Weiland, Wolfgang Utschick:
On the Maximum Achievable Partial Decode-and-Forward Rate for the Gaussian MIMO Relay Channel. IEEE Trans. Inf. Theory 61(12): 6751-6758 (2015)- [c11]Andreas Gründinger, Lennart Gerdes, Michael Joham, Wolfgang Utschick:
Bounds on the outage constrained capacity of the single-antenna Gaussian relay channel. CISS 2015: 1-6 - [c10]Lennart Gerdes, Maximilian Riemensberger, Wolfgang Utschick:
On the Equivalence of Degraded Gaussian MIMO Broadcast Channels. WSA 2015: 1-5 - 2014
- [j3]Christoph Hellings, Lennart Gerdes, Lorenz Weiland, Wolfgang Utschick:
On Optimal Gaussian Signaling in MIMO Relay Channels With Partial Decode-and-Forward. IEEE Trans. Signal Process. 62(12): 3153-3164 (2014) - [c9]Lennart Gerdes, Lorenz Weiland, Maximilian Riemensberger, Wolfgang Utschick:
Optimal partial decode-and-forward rates for stochastically degraded Gaussian relay channels. CISS 2014: 1-5 - [c8]Lennart Gerdes, Lorenz Weiland, Wolfgang Utschick:
Optimal partial decode-and-forward rates for the Gaussian MIMO relay channel using the GSVD. SPAWC 2014: 259-263 - [c7]Maximilian Riemensberger, Lennart Gerdes, Wolfgang Utschick:
Submodular structure and optimal quantization in Gaussian multiple access relay networks. SPAWC 2014: 319-323 - [i1]Lennart Gerdes, Christoph Hellings, Lorenz Weiland, Wolfgang Utschick:
The Optimal Input Distribution for Partial Decode-and-Forward in the MIMO Relay Channel. CoRR abs/1409.8624 (2014) - 2013
- [j2]Lennart Gerdes, Maximilian Riemensberger, Wolfgang Utschick:
Bounds on the capacity regions of half-duplex Gaussian MIMO relay channels. EURASIP J. Adv. Signal Process. 2013: 43 (2013) - [c6]Lennart Gerdes, Lorenz Weiland, Wolfgang Utschick:
A zero-forcing partial decode-and-forward scheme for the Gaussian MIMO relay channel. ICC 2013: 3349-3354 - [c5]Lorenz Weiland, Lennart Gerdes, Wolfgang Utschick:
Partial decode-and-forward rates for the Gaussian MIMO relay channel: Inner approximation of non-convex rate constraints. SPAWC 2013: 540-544 - 2012
- [j1]Lennart Gerdes, Maximilian Riemensberger, Wolfgang Utschick:
On Achievable Rate Regions for Half-Duplex Gaussian MIMO Relay Channels: A Decomposition Approach. IEEE J. Sel. Areas Commun. 30(8): 1319-1330 (2012) - [c4]Lennart Gerdes, Maximilian Riemensberger, Wolfgang Utschick:
Utility maximization in the half-duplex two-way MIMO relay channel. ICASSP 2012: 2897-2900 - 2011
- [c3]Lennart Gerdes, Wolfgang Utschick:
Optimized capacity bounds for the MIMO relay channel. ICASSP 2011: 3336-3339 - [c2]Lennart Gerdes, Wolfgang Utschick:
Optimized capacity bounds for the half-duplex Gaussian MIMO relay channel. WSA 2011: 1-7 - 2010
- [c1]Lennart Gerdes, Mohit Thakur, Ralf Kötter:
On the Dynamic Behavior of the Min-Cut in Random Geometric Graphs. ICC 2010: 1-6
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 22:58 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:
