Demo Data from EDBT 2026 / reviewers in the wild / expert
Hanan Weingarten
dblp:95/1321
· DBLP profile ↗
6ranked-venue papers
6as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 3 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
2 papers |
Physical-layer communications · 100% | |
| Theoretical computer science
2 papers |
Information theory · 82% Coding theory · 18% |
Topics — the 16 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › network information theory
broadcast channel |
0.1 | 2 | 2009 | The capacity region of the degraded multiple-input multiple-output compound broadcast channel · IEEE Trans. Inf. Theory 2009 The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel · IEEE Trans. Inf. Theory 2006 |
Physical-layer communications › multiple-antenna systems
multiple-antenna communication |
0.1 | 2 | 2006 | The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel · IEEE Trans. Inf. Theory 2006 Gaussian Codes and Weighted Nearest Neighbor Decoding in Fading Multiple-Antenna Channels · IEEE Trans. Inf. Theory 2004 |
Information theory › channel capacity
capacity region |
0.1 | 1 | 2009 | The capacity region of the degraded multiple-input multiple-output compound broadcast channel · IEEE Trans. Inf. Theory 2009 |
Coding theory
channel coding |
0.1 | 1 | 2009 | The capacity region of the degraded multiple-input multiple-output compound broadcast channel · IEEE Trans. Inf. Theory 2009 |
Information theory › channel capacity › state-dependent channel
compound channel |
0.1 | 1 | 2009 | The capacity region of the degraded multiple-input multiple-output compound broadcast channel · IEEE Trans. Inf. Theory 2009 |
Information theory › communication channels
MIMO |
0.1 | 1 | 2009 | The capacity region of the degraded multiple-input multiple-output compound broadcast channel · IEEE Trans. Inf. Theory 2009 |
Physical-layer communications
channel coding |
0.1 | 2 | 2006 | The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel · IEEE Trans. Inf. Theory 2006 Gaussian Codes and Weighted Nearest Neighbor Decoding in Fading Multiple-Antenna Channels · IEEE Trans. Inf. Theory 2004 |
Physical-layer communications › multiple access › multiple access channel
capacity region |
0.1 | 1 | 2006 | The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel · IEEE Trans. Inf. Theory 2006 |
Physical-layer communications › channel coding › multiuser coding
dirty paper coding |
0.1 | 1 | 2006 | The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel · IEEE Trans. Inf. Theory 2006 |
Physical-layer communications › MIMO › multiuser MIMO › broadcast channel
MIMO broadcast channel |
0.1 | 1 | 2006 | The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel · IEEE Trans. Inf. Theory 2006 |
Physical-layer communications
channel estimation |
0.0 | 1 | 2004 | Gaussian Codes and Weighted Nearest Neighbor Decoding in Fading Multiple-Antenna Channels · IEEE Trans. Inf. Theory 2004 |
Physical-layer communications › MIMO › MIMO channel
MIMO fading channels |
0.0 | 1 | 2004 | Gaussian Codes and Weighted Nearest Neighbor Decoding in Fading Multiple-Antenna Channels · IEEE Trans. Inf. Theory 2004 |
Physical-layer communications › channel estimation
MMSE estimation |
0.0 | 1 | 2004 | Gaussian Codes and Weighted Nearest Neighbor Decoding in Fading Multiple-Antenna Channels · IEEE Trans. Inf. Theory 2004 |
Physical-layer communications › signal detection
nearest neighbor decoding |
0.0 | 1 | 2004 | Gaussian Codes and Weighted Nearest Neighbor Decoding in Fading Multiple-Antenna Channels · IEEE Trans. Inf. Theory 2004 |
Information theory
network information theory |
0.0 | 1 | 2006 | The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel · IEEE Trans. Inf. Theory 2006 |
Physical-layer communications › information theory
achievable rate |
0.0 | 1 | 2004 | Gaussian Codes and Weighted Nearest Neighbor Decoding in Fading Multiple-Antenna Channels · IEEE Trans. Inf. Theory 2004 |
Methods — techniques the papers use, named apart from their topics
superposition coding · 0.1entropy power inequality · 0.1training-based scheme · 0.0MMSE estimation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | The capacity region of the degraded multiple-input multiple-output compound broadcast channelabstractThe capacity region of a compound multiple-antenna broadcast channel is characterized when the users exhibit a certain degradedness order. The channel under consideration has two users, each user has a finite set of possible realizations. The transmitter transmits two messages, one for each user, in such a manner that regardless of the actual realizations, both users will be able to decode their messages correctly. An alternative view of this channel is that of a broadcast channel with two common messages, each common message is intended to a different set of users. The degradedness order between the two sets of realizations/users is defined through an additional, fictitious, user whose channel is degraded with respect to all realizations/users from one set while all realizations/users from the other set are degraded with respect to him. Hanan Weingarten, Tie Liu 0002, Shlomo Shamai, Yossef Steinberg, Pramod Viswanath |
IEEE Trans. Inf. Theory | 1 |
| 2007 | The Capacity Region of the Degraded MIMO Compound Broadcast ChannelabstractThe capacity region of a compound multi-antenna broadcast channel is characterized when the users exhibit a certain degradedness order. For this purpose, we bring to bear a new extremal inequality for information theory and utilize a channel enhancement technique. Hanan Weingarten, Tie Liu 0002, Shlomo Shamai, Yossef Steinberg, Pramod Viswanath |
ISIT | 1 |
| 2006 | On the Capacity Region of the Multi-Antenna Broadcast Channel with Common MessagesabstractIn this paper we discuss a two user Multi-Antenna Gaussian broadcast channel with common messages and explore the achievable region suggested by Jindal and Goldsmith. We present simple outer-bounds which are shown to be tight at certain regions. We investigate the aligned channel with common messages and show that beyond a certain threshold on the common rate, the achievable region coincides with the capacity region and we also give a full characterization of the capacity region of the degraded message sets case. Hanan Weingarten, Yossef Steinberg, Shlomo Shamai |
ISIT | 1 |
| 2006 | The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast ChannelabstractThe Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC) is considered. The dirty-paper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power inequality, to show that a superposition of Gaussian codes is optimal for the degraded vector broadcast channel and that DPC is optimal for the nondegraded case. Furthermore, the capacity region is characterized under a wide range of input constraints, accounting, as special cases, for the total power and the per-antenna power constraints Hanan Weingarten, Yossef Steinberg, Shlomo Shamai |
IEEE Trans. Inf. Theory | 1 |
| 2004 | The capacity region of the Gaussian MIMO broadcast channelabstractThe dirty paper coding rate region is shown to be the capacity region of the Gaussian MIMO broadcast channel. To that end, a new notion of an enhanced broadcast channel is introduced. Hanan Weingarten, Yossef Steinberg, Shlomo Shamai |
ISIT | 1 |
| 2004 | Gaussian Codes and Weighted Nearest Neighbor Decoding in Fading Multiple-Antenna ChannelsabstractWe investigate the fading multiple-antenna channel. The decoder is assumed to possess imperfect channel fading information. A modified nearest neighbor decoder with an innovative weighting factor is introduced and an expression for the generalized mutual information (GMI), the achievable rate, is obtained. We show that under certain conditions the achievable rate is equivalent to that of a fading multiple-antenna Gaussian channel where fading is known to the receiver and is equal to the channel estimation, and where noise is due to both the channel noise and the channel estimation error. We show that for our communication scheme, the minimum mean square error (MMSE) channel estimator is optimal in the sense that it achieves the highest value of GMI, and hence the highest communication rate. Additionally, a training based multiple-input multiple-output (MIMO) scheme in a block-fading channel is investigated and it is shown that the number of degrees of freedom depends on the signal-to-noise ratio (SNR). Hanan Weingarten, Yossef Steinberg, Shlomo Shamai |
IEEE Trans. Inf. Theory | 1 |