default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernd Bandemer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j6]Chao Tian, Bernd Bandemer, Shlomo Shamai (Shitz)
:
Gaussian State Amplification with Noisy Observations. IEEE Trans. Inf. Theory 61(9): 4587-4597 (2015)- [j5]Bernd Bandemer, Abbas El Gamal, Young-Han Kim:
Optimal Achievable Rates for Interference Networks With Random Codes. IEEE Trans. Inf. Theory 61(12): 6536-6549 (2015) - 2014
- [j4]Bernd Bandemer, Abbas El Gamal:
Communication With Disturbance Constraints. IEEE Trans. Inf. Theory 60(8): 4488-4502 (2014) - [c20]Fatemeh Arbabjolfaei, Bernd Bandemer, Young-Han Kim:
Index coding via random coding. IWCIT 2014: 1-7 - 2013
- [c19]Bernd Bandemer, Chao Tian, Shlomo Shamai:
Gaussian state amplification with noisy state observations. ISIT 2013: 181-185 - [c18]Fatemeh Arbabjolfaei, Bernd Bandemer, Young-Han Kim, Eren Sasoglu, Lele Wang:
On the capacity region for index coding. ISIT 2013: 962-966 - [c17]Lele Wang, Eren Sasoglu, Bernd Bandemer, Young-Han Kim:
A comparison of superposition coding schemes. ISIT 2013: 2970-2974 - [i9]Lele Wang, Eren Sasoglu, Bernd Bandemer, Young-Han Kim:
A Comparison of Superposition Coding Schemes. CoRR abs/1302.1258 (2013) - [i8]Fatemeh Arbabjolfaei, Bernd Bandemer, Young-Han Kim, Eren Sasoglu, Lele Wang:
On the Capacity Region for Index Coding. CoRR abs/1302.1601 (2013) - [i7]Bernd Bandemer, Chao Tian, Shlomo Shamai:
Gaussian State Amplification with Noisy State Observations. CoRR abs/1302.2178 (2013) - 2012
- [j3]Nicolai Czink, Bernd Bandemer, Claude Oestges, Thomas Zemen, Arogyaswami Paulraj:
Analytical Multi-User MIMO Channel Modeling: Subspace Alignment Matters. IEEE Trans. Wirel. Commun. 11(1): 367-377 (2012) - [c16]Bernd Bandemer, Abbas El Gamal, Young-Han Kim:
Simultaneous nonunique decoding is rate-optimal. Allerton Conference 2012: 9-16 - [c15]Bernd Bandemer:
An achievable rate region for three-pair interference channels with noise. ISIT 2012: 2276-2280 - [i6]Bernd Bandemer:
An Achievable Rate Region for Three-Pair Interference Channels with Noise. CoRR abs/1205.4781 (2012) - [i5]Bernd Bandemer, Abbas El Gamal, Young-Han Kim:
Simultaneous Nonunique Decoding Is Rate-Optimal. CoRR abs/1210.4596 (2012) - 2011
- [j2]Bernd Bandemer, Abbas El Gamal:
Interference Decoding for Deterministic Channels. IEEE Trans. Inf. Theory 57(5): 2966-2975 (2011) - [c14]Bernd Bandemer, Abbas El Gamal:
An achievable rate region for the 3-user-pair deterministic interference channel. Allerton 2011: 38-44 - [c13]Bernd Bandemer, Abbas El Gamal:
Communication with disturbance constraints. ISIT 2011: 2090-2094 - [c12]Anas Chaaban, Aydin Sezgin, Bernd Bandemer, Arogyaswami Paulraj:
On Gaussian Multiple Access Channels with Interference: Achievable Rates and Upper Bounds. MACOM 2011: 87-96 - [c11]Nicolai Czink, Bernd Bandemer, Claude Oestges, Thomas Zemen, Arogyaswami Paulraj:
Subspace Modeling of Multi-User MIMO Channels. VTC Fall 2011: 1-5 - [i4]Bernd Bandemer, Abbas El Gamal:
Communication with Disturbance Constraints. CoRR abs/1103.0996 (2011) - [i3]Anas Chaaban, Aydin Sezgin, Bernd Bandemer, Arogyaswami Paulraj:
On Gaussian Multiple Access Channels with Interference: Achievable Rates and Upper Bounds. CoRR abs/1103.2501 (2011) - 2010
- [j1]Claude Oestges, Nicolai Czink, Bernd Bandemer, Paolo Castiglione, Florian Kaltenberger, Arogyaswami Paulraj:
Experimental Characterization and Modeling of Outdoor-to-Indoor and Indoor-to-Indoor Distributed Channels. IEEE Trans. Veh. Technol. 59(5): 2253-2265 (2010) - [c10]Bernd Bandemer, Abbas El Gamal:
Interference decoding for deterministic channels. ISIT 2010: 340-344 - [i2]Bernd Bandemer, Abbas El Gamal:
Interference Decoding for Deterministic Channels. CoRR abs/1001.4588 (2010)
2000 – 2009
- 2009
- [c9]Bernd Bandemer, Abbas El Gamal, Gonzalo Vazquez-Vilar:
On the sum capacity of a class of cyclically symmetric deterministic interference channels. ISIT 2009: 2622-2626 - [c8]Nicolai Czink, Bernd Bandemer, Gonzalo Vazquez-Vilar, Louay M. A. Jalloul, Claude Oestges, Arogyaswami Paulraj:
Spatial separation of multi-user MIMO channels. PIMRC 2009: 1059-1063 - [c7]Claude Oestges, Nicolai Czink, Bernd Bandemer, Arogyaswami Paulraj:
Capacity performance of outdoor-to-indoor relay schemes in measured radio channels. PIMRC 2009: 1113-1117 - [c6]Claude Oestges, Nicolai Czink, Bernd Bandemer, Paolo Castiglione, Florian Kaltenberger, Arogyaswami Paulraj:
Experimental characterization of indoor multi-link channels. PIMRC 2009: 2985-2989 - [c5]Bernd Bandemer, Qinghua Li, Xintian Eddie Lin, Arogyaswami Paulraj:
Overhearing-based Interference Cancellation for Relay Networks. VTC Fall 2009 - [i1]Bernd Bandemer, Gonzalo Vazquez-Vilar, Abbas El Gamal:
On the Sum Capacity of A Class of Cyclically Symmetric Deterministic Interference Channels. CoRR abs/0901.4068 (2009) - 2008
- [c4]Bernd Bandemer, Aydin Sezgin, Arogyaswami Paulraj:
On the noisy interference regime of the MISO Gaussian interference channel. ACSCC 2008: 1098-1102 - [c3]Aydin Sezgin, Bernd Bandemer, Arogyaswami Paulraj, Eduard A. Jorswieck:
Tile-based MIMO OFDM systems: The impact of inaccurate channel state information. ACSCC 2008: 1326-1329 - 2007
- [c2]Bernd Bandemer, Samuli Visuri:
Capacity-Based Uplink Scheduling Using Long-Term Channel Knowledge. ICC 2007: 785-790 - 2006
- [c1]Bernd Bandemer, Martin Haardt, Samuli Visuri:
Linear MMSE Multi-User MIMO Downlink Precoding for Users with Multiple Antennas. PIMRC 2006: 1-5
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:
