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

Authors

38

  1. RT
    Roy Timo

    University of South Australia, Australia

    4 publications · 92 citations

    4

    h-index

  2. AZ
    Abdellatif Zaidi

    UCLouvain, Belgium

    2 publications · 23 citations

    2

    h-index

  3. BA
    Behzad Ahmadi

    New Jersey Institute of Technology, United States

    2 publications · 34 citations

    2

    h-index

  4. BN
    Badri N. Vellambi

    University of South Australia, Australia

    2 publications · 23 citations

    2

    h-index

  5. MB
    Meryem Benammar

    Huawei Technologies (France), France

    2 publications · 23 citations

    2

    h-index

1–5 of 38

Venues

  1. IEEE Transactions on Information Theory

    6 publications · 143 citations

    6

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 2 publications · 595 citations

    2

    h-index

  3. European Journal of Political Economy

    1 publications · 30 citations

    1

    h-index

  4. Integral Equations and Operator Theory

    1 publications · 16 citations

    1

    h-index

  5. Entropy

    1 publications · 13 citations

    1

    h-index

1–5