Heegard-berger Problem
The Heegard-Berger Problem is a foundational rate-distortion problem in network information theory that characterizes the minimum achievable rate for reconstructing a source at two decoders with differing side information, where one decoder has access to additional side information not available to the other, thereby distinguishing it from symmetric source coding scenarios.
24
Publications
1.8K
Citations
38
Authors
26
Institutions
Publications per year
2017–2026
2
Variants
Heegard-berger Source Coding Problem
Parents
24
Proceedings of 1994 IEEE International Symposium on Information Theory
1994 · 201 citations
Job scheduling algorithm based on Berger model in cloud environment
Baomin Xu, Chunyan Zhao, Enzhao Hu et al. · Advances in Engineering Software · 2011 · 172 citations · Full text
1–5 of 24
38
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 38
26

University of South Australia
Adelaide, Australia
4 h-index
8 publications
211 citations
Huawei Technologies (France)
Boulogne-Billancourt, France
2 h-index
3 publications
33 citations
New Jersey Institute of Technology
Newark, United States
2 h-index
4 publications
68 citations
University of Utah
Salt Lake City, United States
2 h-index
2 publications
595 citations
École Polytechnique
Palaiseau, France
2 h-index
2 publications
595 citations
Centre de Mathématiques Appliquées de l'École polytechnique
Palaiseau, France
2 h-index
2 publications
595 citations
Signal Processing (United States)
Rockville, United States
2 h-index
3 publications
281 citations
University of Mannheim
Mannheim, Germany
1 h-index
1 publications
30 citations
1–8 of 26
6 publications · 143 citations
6
h-index
TRAN · 2 publications · 595 citations
2
h-index
1 publications · 30 citations
1
h-index
1 publications · 16 citations
1
h-index
1 publications · 13 citations
1
h-index
1–5