Cut-set Bounds

Cut-Set Bounds is a fundamental limit in network information theory that characterizes the maximum achievable rate of information transfer across a network by considering the minimum capacity of all possible cuts that separate the source and destination nodes, where each cut's capacity is the sum of the capacities of the edges crossing the cut.

245

Publications

9.6K

Citations

443

Authors

248

Institutions

Publications per year

2017–2026

32

Authors

443

  1. DT
    David Tse

    University of California, Berkeley, United States

    10 publications · 663 citations

    10

    h-index

  2. MG
    Michael Gastpar

    University of California, Berkeley, United States

    8 publications · 564 citations

    8

    h-index

  3. AS
    Aydin Sezgin

    Ruhr University Bochum, Germany

    8 publications · 216 citations

    8

    h-index

  4. GK
    Gerhard Kramer

    Technical University of Munich, Germany

    7 publications · 333 citations

    7

    h-index

  5. SD
    Suhas Diggavi

    University of California, Los Angeles, United States

    6 publications · 518 citations

    6

    h-index

1–5 of 443

Venues

  1. IEEE Transactions on Information Theory

    41 publications · 2.3K citations

    22

    h-index

  2. arXiv (Cornell University)

    Repository · 11 publications · 212 citations

    10

    h-index

  3. ArXiv.org

    Repository · 7 publications · 567 citations

    7

    h-index

  4. IEEE Transactions on Communications

    6 publications · 153 citations

    6

    h-index

  5. IEEE Transactions on Signal Processing

    5 publications · 169 citations

    5

    h-index

1–5